A note on the uniqueness of (w, r) cover-free codes

DOI10.1007/S11122-005-0024-4zbMATH Open1104.94058OpenAlexW2050818843MaRDI QIDQ2432945FDOQ2432945

Authors: Vladimir Lebedev 

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

Recommendations

• On the optimality of trivial \((w,r)\)-cover-free codes
• Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
• On optimal superimposed codes
• On the construction of \((w,r)\) cover-free codes
• Almost cover-free codes

zbMATH Keywords

optimal and unique \((w,r)\) cover-free code

Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial aspects of block designs (05B05) Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40) Extremal set theory (05D05)

Cites Work

• Title not available (Why is that?)
• Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
• Families of finite sets in which no set is covered by the union of \(r\) others
• On optimal superimposed codes
• Some new bounds for cover-free families
• When is individual testing optimal for nonadaptive group testing?
• Key storage in secure networks
• Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
• Interval packing and covering in the Boolean lattice
• Uniqueness of some optimal superimposed codes

Cited In (2)

• Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
• On the optimality of trivial \((w,r)\)-cover-free codes

This page was built for publication: A note on the uniqueness of \((w, r)\) cover-free codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432945)