By Topic

Complete Distances of All Negacyclic Codes of Length 2s Over Z2a

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Dinh, H.Q. ; Dept. of Math. Sci., Kent State Univ., Warren, OH

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

Published in:

Information Theory, IEEE Transactions on  (Volume:53 ,  Issue: 1 )