Author_Institution :
Dept. of Math. Sci., Kent State Univ., Warren, OH
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 codes
Keywords :
Hamming codes; cyclic codes; A-constacyclic code; Hamming distance calculation; Hamming weight distribution; Hamming weight enumerator; negacyclic code; structure theorem; Binary codes; Distributed computing; Euclidean distance; Galois fields; Hamming distance; Hamming weight; Linear code; Testing; Binary codes; Euclidean distance; Hamming distance; Lee distance; chain rings; codes over finite rings; constacyclic codes; cyclic codes; homogeneous distance; negacyclic codes; quarternary codes; repeated-root codes;