Salagean-repeated-root-DAM.pdf (188.67 kB)
Download file

Repeated-root cyclic and negacyclic codes over a finite chain ring

Download (188.67 kB)
journal contribution
posted on 21.08.2006, 17:44 by Ana SalageanAna Salagean
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 bytes

Citation

SALAGEAN, A.M., 2006. Repeated-root cyclic and negacyclic codes over a finite chain ring. Discrete applied mathematics, 154 (2), pp. 413-419

Publisher

© Elsevier

Publication date

2006

Notes

This article was published in the journal, Discrete applied mathematics [© Elsevier] and is also available at: http://www.sciencedirect.com/science/journal/0166218X

ISSN

0166-218X

Language

en