论文信息 - General Upper Bounds on the Minimum Size of Covering Designs

General Upper Bounds on the Minimum Size of Covering Designs

LetDbe a finite family ofk-subsets (called blocks) of av-setX(v). ThenDis a (v, k, t) covering design or covering if everyt-subset ofX(v) is contained in at least one block ofD. The number of blocks is the size of the covering, and the minimum size of the covering is called the covering number. In this paper we find new upper bounds on the covering numbers for several families of parameters.

Katherine Heinrich | Iliya Bluskov | K. Heinrich | I. Bluskov

[1] P. Östergård,et al. Upper Bounds for Covering Designs by Simulated Annealing , 1993 .

[2] Douglas R Stinson,et al. Contemporary design theory : a collection of surveys , 1992 .

[3] Hanfried Lenz,et al. Design theory , 1985 .

[4] J. Goethals. UNIFORMLY PACKED CODES , 1975 .

[5] Zhen Zhang,et al. Bounds on the sizes of constant weight covering codes , 1995, Des. Codes Cryptogr..

[6] G. Kuperberg,et al. New constructions for covering designs , 1995, math/9502238.

[7] Iliya Bluskov,et al. New upper bounds on the minimum size of covering designs , 1998 .

[8] Franco P. Preparata. Weight and Distance Structure of Nordstrom-Robinson Quadratic Code , 1968, Inf. Control..

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