Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes

Tables of 1/p and rate (p-1 )/p binary quasi-cyclic (QC) codes that extend previously published results are presented. Many of these codes attain bounds given by T. Verhoeff (1987), who composed a table of bounds on the maximum possible minimum distance of binary linear codes. Many of the codes presented meet or improve these bounds. A best code is considered to be one which has the largest possible minimum distance for the given code dimensions. n and k, and class of error correcting codes. A good code has the maximum known minimum distance for the class of codes. An optimal code is one that achieves the maximum possible minimum distance for a linear code with the same dimensions. Binary power residue codes are found and used to construct QC codes. >

[1]  Henk C. A. van Tilborg.  On quasi-cyclic codes with rate l m (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[2]  E. J. Weldon,et al.  Some Results on Quasi-Cyclic Codes , 1969, Inf. Control..

[3]  G. Solomon,et al.  A Connection Between Block and Convolutional Codes , 1979 .

[4]  Tadao Kasami.  A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[5]  Sudhakar M. Reddy,et al.  Circulant bases for cyclic codes (Corresp.) , 1970, IEEE Trans. Inf. Theory.

[6]  Tom Verhoeff,et al.  An updated table of minimum-distance bounds for binary linear codes , 1987, IEEE Trans. Inf. Theory.

[7]  M. Karlin,et al.  New binary coding results by circulants , 1969, IEEE Trans. Inf. Theory.

[8]  Philippe Piret.  Good linear codes of length 27 and 28 (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[9]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[10]  Vijay K. Bhargava,et al.  Some rate- p/(p+1) quasi-cyclic codes (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[11]  V. Bhargava,et al.  The (151, 136) 10th-power residue code and its performance , 1983, Proceedings of the IEEE.

[12]  Maurice Karlin.  Decoding of circulant codes (Corresp.) , 1970, IEEE Trans. Inf. Theory.

[13]  Elwyn R. Berlekamp,et al.  Distribution of cyclic matrices in a finite field , 1966 .

[14]  Vijay K. Bhargava,et al.  Some (ink, k) cyclic codes in quasi-cyclic form (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[15]  F. Jessie MacWilliams.  Decomposition of cyclic codes of block lengths 3p, 5p, 7p (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[16]  Vijay K. Bhargava,et al.  Equivalent rate 1/2 quasi-cyclic codes (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[17]  Vijay K. Bhargava,et al.  Weight distribution of some 'best' (3m, 2m) binary quasi-cyclic codes (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[18]  J Stein,et al.  Equivalent rate 1/2 quasi-cyclic codes , 1975 .

[19]  M. Serra,et al.  CONSTRUCTION OF QUASI-CYCLIC CODES , 1989 .

[20]  W. W. Peterson,et al.  Error-Correcting Codes. , 1962 .

[21]  R. Townsend,et al.  Self-orthogonal quasi-cyclic codes , 1967, IEEE Trans. Inf. Theory.