DocumentCode :
914844
Title :
On cyclic codes that are invariant under the general linear group
Author :
Delsarte, Philippe
Volume :
16
Issue :
6
fYear :
1970
fDate :
11/1/1970 12:00:00 AM
Firstpage :
760
Lastpage :
769
Abstract :
Using a polynomial approach to linear codes, one derives necessary and sufficient conditions for cyclic 
-ary codes to be invariant under the general linear group of substitutions over an extension field of 
. The important class of polynomial codes, introduced by Kasami, Lin, and Peterson, satisfy the conditions and several new results are obtained about some of these codes.
-ary codes to be invariant under the general linear group of substitutions over an extension field of . The important class of polynomial codes, introduced by Kasami, Lin, and Peterson, satisfy the conditions and several new results are obtained about some of these codes.Keywords :
Cyclic codes; Polynomial codes; Galois fields; Linear code; Manufacturing; Sufficient conditions;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1970.1054554
Filename :
1054554
Link To Document :
