A classification of the structures of some Sperner families and superimposed codes
From MaRDI portal
Publication:2502898
DOI10.1016/j.disc.2006.03.049zbMath1100.05099OpenAlexW2124463179MaRDI QIDQ2502898
Publication date: 13 September 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.049
Related Items (2)
Structures and lower bounds for binary covering arrays ⋮ Corrigendum to ``A classification of the structures of some Sperner families and superimposed codes
Cites Work
- Unnamed Item
- Unnamed Item
- Families of finite sets in which no set is covered by the union of \(r\) others
- Families of finite sets in which no set is covered by the union of two others
- Some new bounds for cover-free families
- On optimal superimposed codes
- Nonrandom binary superimposed codes
- Some new results on superimposed codes
- Two-Part and k-Sperner Families: New Proofs Using Permutations
- A short proof of Sperner's lemma
- On a lemma of Littlewood and Offord
This page was built for publication: A classification of the structures of some Sperner families and superimposed codes