Complete Distances of All Negacyclic Codes of Length $2^{s}$ Over $\BBZ _{2^{a}}$
- 26 December 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 53 (1), 147-161
- https://doi.org/10.1109/tit.2006.887487
Abstract
Various kinds of distances of all negacyclic codes of length 2s over Zopf2 a are completely determined. Using our structure theorems of negacyclic codes of length 2 s over Zopf2 a, we first calculate the Hamming distances of all such negacyclic codes, which particularly lead to the Hamming weight distributions and Hamming weight enumerators of several codes. These Hamming distances are then used to obtain their homogeneous, Lee, and Euclidean distances. Our techniques are extendable to the more general class of constacyclic codes, namely, the lambda- constacyclic codes of length 2s over Zopf2 a , where lambda is any unit of Zopf2 a with the form 4k-1. We establish the Hamming, homogeneous, Lee, and Euclidean distances of all such constacyclic codesKeywords
This publication has 29 references indexed in Scilit:
- Repeated-root constacyclic codes of length 2^{𝑠} over ℤ_{2^{𝕒}}Contemporary Mathematics, 2006
- Negacyclic Codes of Length$2^s$Over Galois RingsIEEE Transactions on Information Theory, 2005
- Cyclic and Negacyclic Codes Over Finite Chain RingsIEEE Transactions on Information Theory, 2004
- On the generators of Z/sub 4/ cyclic codes of length 2/sup e/IEEE Transactions on Information Theory, 2003
- Fundamentals of Error-Correcting CodesPublished by Cambridge University Press (CUP) ,2003
- Finite-Ring Combinatorics and MacWilliams' Equivalence TheoremJournal of Combinatorial Theory, Series A, 2000
- Self-dual codes over rings and the Chinese remainder theoremHokkaido Mathematical Journal, 1999
- Gray isometries for finite chain rings and a nonlinear ternary (36, 3/sup 12/, 15) codeIEEE Transactions on Information Theory, 1999
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codesIEEE Transactions on Information Theory, 1994
- Four fundamental parameters of a code and their combinatorial significanceInformation and Control, 1973