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 gener...

Full description

Saved in:
Bibliographic Details
Main Author: Ana Salagean
Format: Default Article
Published: 2006
Subjects:
Theory of computation not elsewhere classified
Other information and computing sciences not elsewhere classified
Repeated-root cyclic codes
Finite chain ring
Principal ideal ring
Computation Theory and Mathematics
Information and Computing Sciences not elsewhere classified
Online Access:https://hdl.handle.net/2134/2326
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://hdl.handle.net/2134/2326

Similar Items