Improved sphere bounds on the coveting radius of codes

The sphere bound is a trivial lower bound on K(n,R), the minimal cardinality of any binary code of length n and with covering radius R. By simple arguments it is considerably improved, to K(n,1)>or=2/sup n//n for n even. A table of lower and upper bounds on K(n,R) for n >

[1]  John Todd,et al.  Covering theorems for groups , 1948 .

[2]  R. G. Stanton,et al.  Covering Problems for Dichotomized Matching , 1968 .

[3]  Hiram Fernandes,et al.  The Football Pool Problem for 7 and 8 Matches , 1983, J. Comb. Theory, Ser. A.

[4]  J. H. van Lint,et al.  The football pool problem for 5 matches , 1967 .

[5]  S. K. Zaremba.  A Covering Theorem for Abelian Groups , 1951 .

[6]  S. K. Zaremba.  Covering Problems Concerning Abelian Groups , 1952 .

[7]  R. G. Stanton,et al.  Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components , 1969 .

[8]  Aimo Tietäväinen.  Bounds for Binary Codes Just Outside the Plotkin Range , 1980, Inf. Control..

[9]  R. G. Stanton,et al.  A Combinatorial Problem in Matching , 1969 .

[10]  Ewald W. Weber.  On the Football Pool Problem for 6 Matches: A New Upper Bound , 1983, J. Comb. Theory, Ser. A.

[11]  N. J. A. Sloane,et al.  On the covering radius of codes , 1985, IEEE Trans. Inf. Theory.

[12]  Gérard D. Cohen,et al.  Covering radius - Survey and recent results , 1985, IEEE Trans. Inf. Theory.

[13]  R. G. Stanton,et al.  Intersection Inequalities for the Covering Problem , 1969 .

[14]  Gerald Losey.  Note on a theorem of Zaremba , 1969 .

[15]  Joseph Douglas Horton,et al.  On Covering Sets and Error-Correcting Codes , 1971, J. Comb. Theory, Ser. A.

[16]  M. Best,et al.  Binary codes with a minimum distance of four (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[17]  T. J. Dickson.  On a Covering Problem Concerning Abelian Groups , 1971 .

[18]  N. J. A. Sloane,et al.  On a conjecture concerning coverings of Hamming space , 1984, AAECC.

[19]  J. G. Mauldon.  Covering theorems for groups , 1950 .

[20]  N. J. A. Sloane,et al.  Further results on the covering radius of codes , 1986, IEEE Trans. Inf. Theory.