A note on the uniqueness of \((w, r)\) cover-free codes
From MaRDI portal
Publication:2432945
DOI10.1007/s11122-005-0024-4zbMath1104.94058OpenAlexW2050818843MaRDI QIDQ2432945
Publication date: 26 October 2006
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11122-005-0024-4
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
- Uniqueness of some optimal superimposed codes
- Families of finite sets in which no set is covered by the union of \(r\) others
- Key storage in secure networks
- Some new bounds for cover-free families
- Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
- When is Individual Testing Optimal for Nonadaptive Group Testing?
- Interval Packing and Covering in the Boolean Lattice
- On optimal superimposed codes
This page was built for publication: A note on the uniqueness of \((w, r)\) cover-free codes
