论文信息 - On the Upper Bound of the Size of the R-Cover-Free Families - 字舞流文

On the Upper Bound of the Size of the R-Cover-Free Families

Let T(r; n) denote the maximum number of subsets of an n-set satisfying the condition in the title. It is proved in a purely combinatorial way, that for n suuciently large log 2 T(r; n) n 8 log 2 r r 2 holds.

Miklós Ruszinkó | M. Ruszinkó

[1] Peter Frankl,et al. On Sperner Families Satisfying an Additional Condition , 1976, J. Comb. Theory, Ser. A.

[2] Noga Alon,et al. Explicit construction of exponential sized families of k-independent sets , 1986, Discret. Math..

[3] Selmer M. Johnson. On upper bounds for unrestricted binary-error-correcting codes , 1971, IEEE Trans. Inf. Theory.

[4] Selmer M. Johnson. Improved asymptotic bounds for error-correcting codes , 1963, IEEE Trans. Inf. Theory.

[5] P. Erdös,et al. Families of finite sets in which no set is covered by the union ofr others , 1985 .

[6] Vojtech Rödl,et al. Near Perfect Coverings in Graphs and Hypergraphs , 1985, Eur. J. Comb..

[7] Zoltán Füredi,et al. Colored packing of sets , 1987 .

[8] Zoltán Füredi,et al. Families of Finite Sets in Which No Set Is Covered by the Union of Two Others , 1982, J. Comb. Theory, Ser. A.

[9] Richard C. Singleton,et al. Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.

[10] F. Hwang. A Method for Detecting all Defective Members in a Population by Group Testing , 1972 .

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

[12] D. A. Bell,et al. Information Theory and Reliable Communication , 1969 .

[13] Selmer M. Johnson. A new upper bound for error-correcting codes , 1962, IRE Trans. Inf. Theory.