• Title/Summary/Keyword: linear codes over Z$_4$

Search Result 3, Processing Time 0.015 seconds

OPTIMAL LINEAR CODES OVER ℤm

  • Dougherty, Steven T.;Gulliver, T. Aaron;Park, Young-Ho;Wong, John N.C.
    • Journal of the Korean Mathematical Society
    • /
    • v.44 no.5
    • /
    • pp.1139-1162
    • /
    • 2007
  • We examine the main linear coding theory problem and study the structure of optimal linear codes over the ring ${\mathbb{Z}}_m$. We derive bounds on the maximum Hamming weight of these codes. We give bounds on the best linear codes over ${\mathbb{Z}}_8$ and ${\mathbb{Z}}_9$ of lengths up to 6. We determine the minimum distances of optimal linear codes over ${\mathbb{Z}}_4$ for lengths up to 7. Some examples of optimal codes are given.

길이가 16인 Z$_4$위의 Preparata 부호는 연쇄조건을 만족하지 않는다

  • Kyeongcheol Yang;Dooroo Lim
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 1996.11a
    • /
    • pp.286-294
    • /
    • 1996
  • In a remarkable paper 〔3〕, Hammons et al. showed that, when properly defined, the binary nonlinear Preparata code can be considered as the Gray map of a linear code eve. Z$_4$, the so-called Preparata code eve. Z$_4$. Recently, Yang and Helleseth 〔12〕 considered the generalized Hamming weights d$\_$r/(m) for Preparata codes of length 2$\^$m/ over Z$_4$ and exactly determined d$\_$r/, for r = 0.5,1.0,1.5,2,2.5 and 3.0. In particular, they completely determined d$\_$r/(m) for any r in the case of m $\leq$ 6. In this paper we show that the Preparata code of length 16 over Z$_4$ does not satisfy the chain condition.

  • PDF

MACWILLIAMS IDENTITIES OVER $M_n\times_s(Z_4)$ WITH RESPECT TO THE RT METRIC

  • Zhu, Shi-Xin;Xu, He-Qian
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.1_2
    • /
    • pp.107-120
    • /
    • 2008
  • There has been a recent growth of interest in codes with respect to a newly defined non-Hamming metric grown as the Rosenbloom-Tsfasman metric (RT, or $\rho$, in short). In this paper, the definitions of the Lee complete $\rho$ weight enumerator and the exact complete $\rho$ weight enumerator of a code over $M_n_\times_s(Z_4)$ are given, and the MacWilliams identities with respect to this RT metric for the two weight enumerators of a linear code over $M_n_\times_s(Z_4)$ are proven too. At last, we also prove that the MacWilliams identities for the Lee and exact complete $\rho$ weight enumerators of a linear code over $M_n_\times_s(Z_4)$ are the generalizations of the MacWilliams identities for the Lee and complete weight enumerators of the corresponding code over $Z_4$.

  • PDF