Handbook of Coding Theory
A note on the q-ary image of a qm-ary repeated-root cyclic code
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Weight distributions of cyclic self-dual codes
IEEE Transactions on Information Theory
Cyclic and negacyclic codes over finite chain rings
IEEE Transactions on Information Theory
Negacyclic codes of length 2s over galois rings
IEEE Transactions on Information Theory
Complete Distances of All Negacyclic Codes of Length 2s Over Z2a
IEEE Transactions on Information Theory
The Minimum Hamming Distance of Cyclic Codes of Length 2ps
AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Constacyclic codes of length 2sover Galois extension rings of F2 + uF2
IEEE Transactions on Information Theory
A class of constacyclic codes over Zpm
Finite Fields and Their Applications
Trace representation of quasi-negacyclic codes
BICS'13 Proceedings of the 6th international conference on Advances in Brain Inspired Cognitive Systems
Hi-index | 0.06 |
We investigate negacyclic and cyclic codes of length p^s over the finite field F"p"^"a. Negacyclic codes of length p^s are precisely the ideals of the chain ring F"p"^"a[x]. This structure is then used to obtain the Hamming distance distribution of the class of such negacyclic codes, which also provides Hamming weight distributions and enumerations of several codes. An one-to-one correspondence between negacyclic and cyclic codes is established to carry accordingly those results of negacyclic codes to cyclic codes.