Title of article
Cyclic codes over finite rings
Author/Authors
Marcus Greferath، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
5
From page
273
To page
277
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 xn − 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.
Journal title
Discrete Mathematics
Serial Year
1997
Journal title
Discrete Mathematics
Record number
951699
Link To Document