Title :
On a sequence of cyclic codes with minimum distance six
Author :
Danev, Danyo ; Olsson, Jonas
Author_Institution :
Dept. of Electr. Eng., Linkoping Univ., Sweden
Abstract :
A sequence of q-ary cyclic codes is considered. For each finite field GF(q), q⩾4, there is a code with parameters [n,k,d;q]=[q(q-1)+1, q(q-1)-6,6;q]. We show that all these codes are n-, k- and d-optimal, with only one exception. Also the dual codes are considered. Their true minimum distances are calculated in the range 4⩽q⩽29
Keywords :
Galois fields; cyclic codes; dual codes; GF(q); dual codes; finite field; minimum distance; optimal codes; q-ary cyclic codes sequence; Codes; Galois fields; Information rates; Polynomials; Software; Terminology;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866496
