Packing radius, covering radius, and dual distance

Tietaivainen (1991) derived an upper bound on the covering radius of codes as a function of the dual distance. This was generalized to the minimum distance, and to Q-polynomial association schemes by Levenshtein and Fazekas. Both proofs use a linear programming approach. In particular, Levenshtein and Fazekas (1990) use linear programming bounds for codes and designs. In this article, proofs relying solely on the orthogonality relations of Krawtchouk (1929), Lloyd, and, more generally, Krawtchouk-adjacent orthogonal polynomials are derived. As a by-product upper bounds on the minimum distance of formally self-dual binary codes are derived. >

[1]  Patrick Solé,et al.  The second eigenvalue of regular graphs of given girth , 1992, J. Comb. Theory, Ser. B.

[2]  N. J. A. Sloane,et al.  A new upper bound on the minimal distance of self-dual codes , 1990, IEEE Trans. Inf. Theory.

[3]  Monique Laurent.  Upper Bounds for the Cardinality of s-Distances Codes , 1986, Eur. J. Comb..

[4]  Aimo Tietäväinen.  Covering radius and dual distance , 1991, Des. Codes Cryptogr..

[5]  Kishan G. Mehrotra,et al.  Generalization of the Norse bounds to codes of higher strength , 1991, IEEE Trans. Inf. Theory.

[6]  Patrick Solé,et al.  Spectra of Regular Graphs and Hypergraphs and Orthogonal Polynomials , 1996, Eur. J. Comb..

[7]  Vladimir I. Levenshtein,et al.  On Upper Bounds for Code Distance and Covering Radius of Designs in Polynomial Metric Spaces , 1995, J. Comb. Theory, Ser. A.

[9]  Patrick Solé,et al.  Asymptotic bounds on the covering radius of binary codes , 1990, IEEE Trans. Inf. Theory.

[10]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[11]  Tor Helleseth,et al.  On the covering radius of binary codes (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[12]  Philippe Delsarte,et al.  Four Fundamental Parameters of a Code and Their Combinatorial Significance , 1973, Inf. Control..

[13]  A. Neumaier,et al.  Distance Regular Graphs , 1989 .

[14]  V. Levenshtein.  Designs as maximum codes in polynomial metric spaces , 1992 .

[15]  Vladimir I. Levenshtein,et al.  Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces , 1995, IEEE Trans. Inf. Theory.

[16]  Vladimir I. Levenshtein,et al.  Bounds for Codes as Solutions of Extremum Problems for Systems of Orthogonal Polynominals , 1993, AAECC.