An Upper Bound on the Covering Radius as a Function of the Dual Distance

IEEE Transactions on Information Theory

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

  Tietavainen, Aimo A ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BCH CODES; COVERING RADIUS; DUAL DISTANCE;

CODES, SYMBOLIC;

EID: 0025519421     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.59949     Document Type: Article

References (16)

1. D. R. Anderson, “A new class of cyclic codes,” SIAM J. Appl. Math., vol. 16, pp. 181–197, 1968.
2. L. Carlitz and S. Uchiyama, ‘‘Bounds for exponential sums,” Duke Math. J., vol. 24, pp. 37–41, 1957.
3. G. P. Cohen, M. R. Karpovsky, H. F. Mattson Jr., and J. R. Schatz, “Covering radius—Survey and recent results,” IEEE Trans. Inform. Theory, vol. IT-31, 328–343, 1985.
4. P. Delsarte, “An algebraic approach to coding theory,” Philips Research Reports Supplements, vol. 10, 1973.
5. D. E. Downie and N. J. A. Sloane, “The covering radius of cyclic codes of length up to 31,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 446–447, 1985.
6. T. Helleseth, T. Klove, and J. Mykkeltveit, “On the covering radius of binary codes,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 627-628, 1978
7. J. Lahtonen, “An optimal polynomial for a covering radius problem,” preprint
8. V. I. Levenshtein, “Bounds on the maximum size of a code with limited scalar product modulus,” Dokl. Akad. Nauk SSSR, vol. 263, pp. 1303-1308, 1982
9. J. H. van Lint, Introduction to Coding Theory. New York: Springer-Verlag, 1982
10. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North Holland, 1977
11. R. J. McEliece, E. R. Rodemich, H. Rumsey, and L. R. Welch, “New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 157-166, 1977
12. C. J. Moreno and O. Moreno, “Exponential sums and Goppa codes II,” preprint
13. C. J. Moreno and O. Moreno, “An improved Carlitz-Uchiyama bound in characteristic two,” preprint
14. P. Sole, “Asymptotic bounds on the covering radius of binary codes,” IEEE Trans. Inform. Theory (to appear)
15. P. Sole and K. G. Mehrotra, “Generalization of the Norse bound to codes of higher strength,” IEEE Trans. Inform. Theory (to appear)
16. A. Tietaviiinen, “Covering radius and dual distance,” Design, Codes and Cryptography, to appear