Salagean-repeated-root-DAM.pdf (188.67 kB)
Repeated-root cyclic and negacyclic codes over a finite chain ring
We show that repeated-root cyclic codes over a finite chain ring are in general not
principally generated. Repeated-root negacyclic codes are principally generated if the
ring is a Galois ring with characteristic a power of 2. For any other finite chain ring
they are in general not principally generated. We also prove results on the structure,
cardinality and Hamming distance of repeated-root cyclic and negacyclic codes over a
finite chain ring.
History
School
- Science
Department
- Computer Science
Pages
170534 bytesCitation
SALAGEAN, A.M., 2006. Repeated-root cyclic and negacyclic codes over a finite chain ring. Discrete applied mathematics, 154 (2), pp. 413-419Publisher
© ElsevierPublication date
2006Notes
This article was published in the journal, Discrete applied mathematics [© Elsevier] and is also available at: http://www.sciencedirect.com/science/journal/0166218XISSN
0166-218XLanguage
- en