✦ LIBER ✦

Some New Bounds for Cover-Free Families

✍ Scribed by D.R. Stinson; R. Wei; L. Zhu

Book ID: 102585148
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 114 KB
Volume: 90
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.1999.3036

No coin nor oath required. For personal study only.

✦ Synopsis

Let N((w, r), T) denote the minimum number of points in a (w, r)-cover-free family having T blocks. In this paper, we prove two new lower bounds on N.

📜 SIMILAR VOLUMES

Some new bounds for cover-free families

Some new bounds for cover-free families through biclique covers

✍ Hossein Hajiabolhassan; Farokhlagha Moazami 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 243 KB

On a Bound of Cover-Free Families

✍ X. Ma; R. Wei 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 150 KB

Some new lower bounds for binary and ter

Some new lower bounds for binary and ternary covering codes

✍ van Wee, G.J.M. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 285 KB

Cover-Free Families and Topology-Transpa

Cover-Free Families and Topology-Transparent Scheduling for MANETs

✍ Charles J. Colbourn; Alan C. H. Ling; Violet R. Syrotiuk 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 716 KB

New lower bounds for covering codes

✍ Hou, X.-D. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 354 KB

Binary codes with covering radius one: S

Binary codes with covering radius one: Some new lower bounds

✍ Laurent Habsieger 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 514 KB