Asymptotic Bounds on the Covering Radius of Binary Codes

IEEE Transactions on Information Theory

Volumn 36, Issue 6, 1990, Pages 1470-1472

  Sole, Patrick ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC COVERING PROPERTIES; BCH CODES; BINARY CODES; COVERING RADIUS; QUADRATIC RESIDUE CODES; REED-MULLER CODES;

CODES, SYMBOLIC;

EID: 0025522795     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.59948     Document Type: Article

References (10)

1. G. D. Cohen, M. R. Karpovsky, H. F. Mattson, Jr., and J. R. Schatz, “Covering radius: Survey and recent results,” IEEE Trans. Inform. Theory, vol. 31, no. 3, pp. 328–343, May 1985.
2. P. Delsarte, “For fundamental parameters of a code and their combinatorial significance,” Inform. Contr., vol. 23, pp. 407–438, 1973.
3. P. Delsarte and P. Piret, “Do most binary linear codes achieve the Goblick bound on the covering radius?” IEEE Trans. Inform. Theory, vol. IT-32, no. 6, pp. 826–828, Nov. 1986.
4. P. Delsarte, “Distance distribution of functions over Flamming spaces,” Phil. Res. Rep., vol. 30, no. 1, pp. 1–8, 1975.
5. W. Feller, An Introduction to Probability Theory and its Applications, vol. I. New York: Wiley, 1957.
6. R. L. Graham and N. J. A. Sloane, “On the covering radius of codes,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 385–401, 1985.
7. T. Helleseth, T. Klove, and J. Mykkelveit, On the covering radius of binary codes,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 627–628, 1978.
8. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes. New York: North Holland, 1981.
9. J. Pach and J. Spencer, “Explicit codes with low covering radius,” IEEE Trans. Inform. Theory, vol. 34, no. 5, pp. 1281–1285, Sept. 1988.
10. V. M. Sidelnikov, “Weight spectrum of binary Bose-Chaudhuri-Hocquengem codes,” Probl. Inform. Transm., vol. 7, no. 1, pp. 11–17, 1971.