Six New Binary Quasi-Cyclic Codes

IEEE Transactions on Information Theory

Volumn 40, Issue 5, 1994, Pages 1666-1667

  Chen, Zhi ^a  

^a KRISTIANSTAD UNIVERSITY   (Sweden)

Author keywords

best known binary codes; coding and codes; Quasi cyclic codes

Indexed keywords

BLOCK CODES; ENCODING (SYMBOLS); INFORMATION THEORY; MATRIX ALGEBRA; POLYNOMIALS; SET THEORY;

BEST BINARY LINEAR CODES; CODEWORD; LOWER BOUNDS; QUASI CYCLIC CODES;

BINARY CODES;

EID: 0028514132     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.333888     Document Type: Article

References (6)

1. T. T. Gulliver and V. K. Bhargava, “Some best rate 1/p and rate {p - 1)/p systematic quasi-cyclic codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 552-555, May 1991.
2. ——, “Nine good rate (m — 1)/pm quasi-cyclic codes,” IEEE Trans. Inform. Theory, vol. 38, pp. 1366-1369, July 1992.
3. ——, “Twelve good rate (m - r)/pm quasi-cyclic codes,” IEEE Trans. Inform. Theory, vol. 39, 1993.
4. H. C. A. van Tilborg, “On quasi-cyclic codes with rate 1/m,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 628-630, Sept. 1978.
5. G. E. Sequin and G. Drolet, “The theory of 1-generator quasi-cyclic codes,” manuscript, Dep. Elec. Comput. Eng., Royal Military College of Canada, Kingston, Ont., June 1990.
6. A. E. Brouwer and T. Verhoeff, “An updated table of minimum distance bounds for binary linear codes,” IEEE Trans. Inform. Theory, vol. 39, pp. 662-677, Mar. 1993.