Title of article
Indecomposability of cyclic codes
Author/Authors
Yoshimi Kashiwagi، نويسنده , , Isao Kikumasa، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
4
From page
277
To page
280
Abstract
It is stated in Montpetit (1987) that cyclic codes are indecomposable, but it is not true in general. In this paper we will give a necessary and sufficient condition for a cyclic code to be indecomposable, using its generator polynomial.
Keywords
Diameter , Laplacian eigenvalues , Mean distance , Graph eigenvalues
Journal title
Discrete Mathematics
Serial Year
1999
Journal title
Discrete Mathematics
Record number
951305
Link To Document