Bounds on the sizes of constant weight covering codes

Motivated by applications in universal data compression algorithms we study the problem of bounds on the sizes of constant weight covering codes. We are concerned with the minimal sizes of codes of lengthn and constant weightu such that every word of lengthn and weightv is within Hamming distanced from a codeword. In addition to a brief summary of part of the relevant literature, we also give new results on upper and lower bounds to these sizes. We pay particular attention to the asymptotic covering density of these codes. We include tables of the bounds on the sizes of these codes both for small values ofn and for the asymptotic behavior. A comparison with techniques for attaining bounds for packing codes is also given. Some new combinatorial questions are also arising from the techniques.

[1]  Fred B. Schneider,et al.  A Theory of Graphs , 1993 .

[2]  Heikki Hämäläinen,et al.  Upper bounds for football pool problems and mixed covering codes , 1991, J. Comb. Theory, Ser. A.

[3]  Jia-Xi Lu,et al.  On Large Sets of Disjoint Steiner Triple Systems II , 1983, J. Comb. Theory, Ser. A.

[4]  Thomas H. Spencer.  On the size of independent sets in hypergraphs , 1993 .

[5]  Tuvi Etzion.  Large sets of coverings , 1994 .

[6]  Vojtech Rödl,et al.  On a Packing and Covering Problem , 1985, Eur. J. Comb..

[7]  N. J. A. Sloane,et al.  A new table of constant weight codes , 1990, IEEE Trans. Inf. Theory.

[8]  Luc Teirlinck,et al.  A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems , 1991, J. Comb. Theory, Ser. A.

[9]  Robert M. Gray,et al.  Source coding theorems without the ergodic assumption , 1974, IEEE Trans. Inf. Theory.

[10]  Donald L. Kreher,et al.  On (n,5,3)-Turan systems , 1994 .

[11]  Donald L. Kreher,et al.  On the covering of t-sets with (t + 1)-sets: C(9, 5, 4) and C(10, 6, 5) , 1991, Discret. Math..

[12]  Alan Hartman,et al.  Covering triples by quadruples: An asymptotic solution , 1986, J. Comb. Theory, Ser. A.

[13]  Dominique de Caen.  A note on the probabilistic approach to Turán's problem , 1983, J. Comb. Theory, Ser. B.

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

[15]  Lu Jia-xi,et al.  On Large Sets of Disjoint Steiner Triple Systems, IV , 1983, J. Comb. Theory, Ser. A.

[16]  C. C. Lindner,et al.  Construction of large sets of almost disjoint Steiner triple systems , 1975 .

[17]  Jia-Xi Lu.  On Large Sets of Disjoint Steiner Triple Systems I , 1983, J. Comb. Theory, Ser. A.

[18]  Zoltán Füredi,et al.  On the lottery problem , 1996 .

[19]  P. Turán.  On the theory of graphs , 1954 .

[20]  Tuvi Etzion,et al.  New lower bounds for constant weight codes , 1989, IEEE Trans. Inf. Theory.

[21]  R. Stanton,et al.  A computer search for B-coverings , 1980 .

[22]  N. J. A. Sloane,et al.  Lower bounds for constant weight codes , 1980, IEEE Trans. Inf. Theory.

[23]  Marion Fort,et al.  Minimal coverings of pairs by triples , 1958 .