Some Best Rate 1/P and Rate (P -1)/P Systematic Quasi-Cyclic Codes

IEEE Transactions on Information Theory

Volumn 37, Issue 3, 1991, Pages 552-555

  Gulliver, T Aaron ^a,b   Bhargava, Vijay K ^c  

^a DEFENCE RESEARCH AND DEVELOPMENT CANADA   (Canada)

^b CARLETON UNIVERSITY   (Canada)

^c UNIVERSITY OF VICTORIA   (Canada)

Author keywords

nonexhaustive search technique; Quasi cYclic codes; tables of best code

Indexed keywords

BEST RATE CODES; ERROR CORRECTING CODES; LINEAR CODES; MINIMUM DISTANCE; NONEXHAUSTIVE SEARCH; QUASI-CYCLIC CODES;

CODES, SYMBOLIC;

EID: 0026157988     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.79911     Document Type: Article

References (22)

1. C. L. Chen, W. W. Peterson, and E. J. Weldon, Jr., “Some results on quasi-cyclic codes,” Inform. Contr., vol. 15, pp. 407–423, 1969.
2. J. M. Stein, V. K. Bhargava, and S. E. Tavares, “Weight distribution of some “Best” (3m,2m) binary quasi-cyclic codes,” IEEE Trans. Inform. Theory, vol. IT-21, no. 6, pp. 708–711, Nov. 1975.
3. H. C. A. van Tilborg, “On quasi-cyclic codes with rate 1/m,” IEEE Trans. Inform. Theory, vol. IT-24, no. 5, pp. 628–629, Sept. 1978.
4. T. Verhoeff, “An updated table of minimum-distance bounds for binary linear codes,” IEEE Trans. Inform. Theory, vol. IT-33, no. 5, pp. 665–680, Sept. 1987.
5. S. E. Tavares, V. K. Bhargava, and S. G. S. Shiva, “Some rate-p/(p+1) quasi-cyclic codes,” IEEE Trans. Inform. Theory, vol. IT-20, no. 1, pp. 133–135, Jan. 1974.
6. E. J. Weldon, Jr., “Long quasi-cyclic codes are good,” (abstract), IEEE Trans. Inform. Theory, vol. IT-13, no. 1, p. 130, Jan. 1970.
7. T. Kasami, “A Gilbert-Varshamov bound for quasi-cyclic codes of rate 1/2,” IEEE Trans. Inform. Theory, vol. IT-20, no. 5, p. 679, Sept. 1974.
8. R. L. Townsend and E. J. Weldon, Jr., “Self-orthogonal quasi-cyclic codes,” IEEE Trans. Inform. Theory, vol. IT-13, no. 2, pp. 183–195, Apr. 1967.
9. M. Karlin, “New binary coding results by circulants,” IEEE Trans. Inform. Theory, vol. IT-15, no. 1, pp. 81–92, Jan. 1969.
10. M. Karlin, “Decoding of circulant codes,” IEEE Trans. Inform. Theory, vol. IT-16, no. 6, pp. 797–802, Nov. 1970.
11. V. K. Bhargava, G. E. Seguin, and J. M. Stein, “Some (mk, k) cyclic codes in quasi-cyclic form,” IEEE Trans. Inform. Theory, vol. IT-24, no. 5, pp. 630–632, Sept. 1978.
12. G. Solomon and H. C. A. van Tilborg, “A connection between block codes and convolutional codes,” SIAM J. Appl. Math., vol. 37, pp. 358–369, Oct. 1979.
13. R. M. Tanner, “Convolutional codes from quasi-cyclic codes: a link between the theories of block and convolutional codes,” in IEEE Int. Symp. Inform. Theory, Kobe, Japan, June 1988.
14. E. R. Berlekamp, “Distribution of cyclic matrices in a finite field,” Duke Math. J., vol. 33, pp. 45–48, 1966.
15. W. W. Peterson and E. J. Weldon, Jr., Error-Correcting Codes. Cambridge, MA: MIT Press, 1972.
16. C. W. Hoffner and S. M. Reddy, “Circulant bases for cyclic codes,” IEEE Trans. Inform. Theory, vol. IT-16, no. 4, pp. 511–512, July 1970.
17. F. J. MacWilliams, “Decomposition of cyclic codes of block lengths 3p,5p,7p,” IEEE Trans. Inform. Theory, vol. IT-25, no. 1, pp. 112–118, Jan. 1979.
18. J. M. Stein and V. K. Bhargava, “Equivalent rate 1/2 quasi-cyclic codes,” IEEE Trans. Inform. Theory, vol. IT-21, no. 5, pp. 588–589, Sept. 1975.
19. P. Piret, “Good linear codes of length 27 and 28,” IEEE Trans. Inform. Theory, vol. IT-26, no. 3, p. 227, Mar. 1980.
20. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw Hill, 1969.
21. V. K. Bhargava, “The (151,136) 10th power residue code and its performance,” Proc. IEEE, vol. 71, pp. 683–685, May 1983.
22. T. A. Gulliver, “Construction of quasi-cyclic codes,” Ph.D. thesis, Univ. of Victoria, Victoria, BC, Canada, 1989.