DocumentCode :
941969
Title :
Inequivalent cyclic codes of prime length (Corresp.)
Author :
Newhart, Donald W.
Volume :
32
Issue :
5
fYear :
1986
fDate :
9/1/1986 12:00:00 AM
Firstpage :
703
Lastpage :
705
Abstract :
A characterization of the equivalence classes of prime-length cyclic codes over any finite field is given, generalizing the binary case solved by Leon, Masely, and Pless. In the special case of cyclic 
codes over GF 
, with 
, a one-to-one correspondence between the equivelance classes and the orbits of 
-sets under the affine group, GA 
is established.
codes over GF , with , a one-to-one correspondence between the equivelance classes and the orbits of -sets under the affine group, GA is established.Keywords :
Cyclic coding; Art; Associate members; Computer errors; Decoding; Error correction codes; Galois fields; Orbits; Programming; Reed-Solomon codes;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1986.1057213
Filename :
1057213
Link To Document :
