Abstract
It is well known that cyclic linear codes of length n over a (finite) field F can be characterized in terms of the factors of the polynomial x n − 1 in F[ x]. This paper investigates cyclic linear codes over arbitrary (not necessarily commutative) finite rings and proves the above characterization to be true for a large class of such codes over these rings.
| Original language | Undefined/Unknown |
|---|---|
| Pages (from-to) | 273-277 |
| Number of pages | 5 |
| Journal | Discrete Mathematics |
| Volume | 177 |
| Issue number | 1-3 |
| DOIs | |
| Publication status | Published - 1997 |
| MoE publication type | A1 Journal article-refereed |