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
fDate :
3/1/2000 12:00:00 AM
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⩽32
Keywords :
Galois fields; cyclic codes; dual codes; Galois field; code parameters; code sequence; dual codes; finite field; minimum distance; q-ary cyclic codes; Codes; Galois fields; Polynomials; Terminology;
Journal_Title :
Information Theory, IEEE Transactions on
