On relations between covering radius and dual distance

IEEE Transactions on Information Theory

Volumn 45, Issue 6, 1999, Pages 1808-1816

  Ashikhmin, Alexei E ^a   Honkala, Iiro S ^b   Laihonen, Tero K ^c   Litsyn, Simon N ^b  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b UNIVERSITY OF TURKU   (Finland)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

Constant weight codes; Covering radius; Dual distance; Krawtchouk polynomial

Indexed keywords

DECODING; ERROR CORRECTION; PARAMETER ESTIMATION; POLYNOMIALS; SET THEORY;

BINARY LINEAR CODES; CONSTANT WEIGHT CODES; COVERING RADIUS; DUAL DISTANCE; KRAWTCHOUK POLYNOMIAL;

BINARY CODES;

EID: 0033184629     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.782101     Document Type: Article

References (31)

1. M. Aaltonen, "Bounds on the information rate of tree code as a function on the code's feedback decoding minimum distance," Ann. Univ. Turku A I, vol. 181, pp. 1-168, 1981.
2. M. Aaltonen, "A new upper bound on nonbinary block codes," Discr. Math., vol. 83, pp. 139-160, 1990.
3. G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein, Covering Codes. Amsterdam, The Netherlands: Elsevier, 1997.
4. C. Delorme and P. Sole, "Diameter, covering index, covering radius and eigenvalues," European J. Combin., vol. 12, pp. 95-108, 1991.
5. P. Delsarte, "Four fundamental parameters of a code and their combinatorial significance," Inform. Contr., vol. 23, pp. 407-438, 1973.
6. T. Ericson and V. Zinoviev, "An improvement of the Gilbert bound for constant weight codes," IEEE Trans. Inform. Theory, vol. IT-33, pp. 721-723, 1987.
7. G. Fazekas and V. I. Levenshtein, "On upper bounds for code distance and covering radius of designs in polynomial metric spaces," J. Comb. Theory A, vol. 70, pp. 267-288, 1995.
8. T. Helleseth, T. Kløve, and J. Mykkeltveit, "On the covering radius of binary codes," IEEE Trans. Inform. Theory, vol. IT-24, pp. 627-628, 1978.
9. I. Honkala, T. Laihonen, and S. Litsyn, "On covering radius and discrete Chebyshev polynomials," Appl. Algebra Eng. Comm. Comput., vol. 8, pp. 395-02, 1997.
10. I. Honkala, S. Litsyn, and A. Tietäväinen, "On algebraic methods in covering radius problems," in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Springer Lecture Notes in Computer Science, vol. 948), G. Cohen, M. Giusti, and T. Mora, Eds. Berlin/Heidelberg/New York: Springer-Verlag, 1995, pp. 21-32.
11. I. Honkala, H. Hämäläinen, and M. Kaikkonen, "A modification of the Zinoviev lower bound for constant weight codes," Discr. Appl. Math., vol. 11, pp. 307-310, 1985.
12. G. Kalai and N. Linial, "On the distance distribution of codes," IEEE Trans. Inform. Theory, vol. 41, pp. 1467-1472, 1995.
13. I. Krasikov and S. Litsyn, "Estimates for the range of binomiality in codes' spectra," IEEE. Trans. Inform. Theory, vol. 43, pp. 987-991, 1997.
14. T. Laihonen, "Covering radius of self-complementary codes and BCH codes," in Proc. 1998 IEEE Int. Symp. Information Theory (Cambridge, MA, August 16-21), p. 434.
15. "Estimates on the covering radius when the dual distance is known," Ph.D. dissertation, University of Turku, Turku, Finland, 1998.
16. T. Laihonen and S. Litsyn, "On upper bounds for minimum distance and covering radius of nonbinary codes," Des. Codes Cryptogr., vol. 14, pp. 71-80, 1998.
17. "New bounds on covering radius as a function of dual distance," SIAM J. Discr. Math., to be published.
18. V. I. Levenshtein, "Upper-bound estimates for fixed-weight codes," Probl. Inform. Transm.. vol. 7, pp. 281-287, 1974.
19. "On the minimal redundancy of binary error-correcting codes," Inform. Contr., vol. 28, pp. 268-281, 1975.
20. "Universal bounds for codes and designs," in Handbook of Coding Theory Vol. I, V. S. Pless and W. C. Huffman, Eds. Amsterdam, The Netherlands: Elsevier, 1998.
21. J. van Lint, Introduction to Coding Theory. New York/Berlin: Springer-Verlag, 1982.
22. S. Litsyn and V. Zinoviev, "On recurrent relations for the cardinality of equal-weight codes," in Int. Workshop "Algebraic and Combinatorial Coding Theory," 1988, pp. 181-183.
23. S. Litsyn and A. Tietäväinen, "Upper bounds on the covering radius of a code with a given dual distance," European J. Combin., vol. 173, pp. 265-270, 1996.
24. F. J. Mac Williams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
25. R. J. McEliece, E. R. Rodemich, H. C. Rumsey, and L. R. Welch, "New upper bounds on the rate of the code via the Delsarte-MacWilliams inequalities," IEEE Trans. Inform. Theory, vol. IT-23, pp. 157-166, 1977.
26. W. Rudin, Principles of Mathematical Analysis. Singapore: McGraw-Hill, 1976.
27. V. Sidelnikov, "Upper bounds on the cardinality of binary code with a given minimum distance," Inform. Contr., vol. 28, pp. 292-303, 1975.
28. P. Sole, "Asymptotic bounds on the covering radius of binary codes," IEEE Trans. Inform. Theory, vol. 36, pp. 1470-1472, 1990.
29. P. Sole and P. Stokes, "Covering radius, codimension, and dual-distance width," IEEE Trans. Inform. Theory, vol. 39, pp. 1195-1203, 1993.
30. A. Tietäväinen, "An upper bound on the covering radius as a function of its dual distance," IEEE Trans. Inform. Theory, vol. 36, pp. 1472-1474, 1990.
31. "Covering radius and dual distance," Des. Codes Cryptogr., vol. 1, pp. 31-46, 1991.