On the upper bound of the size of the r-cover-free families

Information Theory and Reliable Communication.

P. M. Lee, Robert T. Gallager · Journal of the Royal Statistical Society Series A (General) · 1970 · 5.6K citations

Engineering, Electrical Engineering, Mathematics +17

Nonrandom binary superimposed codes

William H. Kautz, Robert R. Singleton · IEEE Transactions on Information Theory · 1964 · 708 citations

Engineering, Computer Science, Electrical Engineering +14

A new upper bound for error-correcting codes

Selmer Martin Johnson · IEEE Transactions on Information Theory · 1962 · 465 citations

Engineering, Computer Science, Mathematics +15

Families of finite sets in which no set is covered by the union ofr others

P. Erdös, Péter Frankl, Zoltán Füredi · Israel Journal of Mathematics · 1985 · 444 citations

Natural Sciences, Mathematics, Combinatorics +10

On a Packing and Covering Problem

Vojtěch Rödl · European Journal of Combinatorics · 1985 · 414 citations

Natural Sciences, Computer Science, Mathematics +8