On the construction of (w,r) cover-free codes

DOI10.1134/S0032946009010049MaRDI QIDQ734287zbMATH OpenOpenAlexFDO

Authors O. Yu. Prikhodov, V. M. Sidel'nikov

Publication date 20 October 2009

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0032946009010049

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of packing and covering (05B40) Combinatorial codes (94B25)

Recommendations

• Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
• On optimal superimposed codes
• Some new bounds for cover-free families
• On the optimality of trivial \((w,r)\)-cover-free codes
• Some new results on superimposed codes

Cites work

• Completely separating systems
• Families of finite sets in which no set is covered by the union of \(r\) others
• Key storage in secure networks
• Nonrandom binary superimposed codes
• On optimal superimposed codes
• On some methods for unconditionally secure key distribution and broadcast encryption

Cited in

(6)

• On the optimality of trivial \((w,r)\)-cover-free codes
• Bounds on the rate of disjunctive codes
• Almost cover-free codes
• Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
• A note on the uniqueness of \((w, r)\) cover-free codes
• Cover-free codes and separating system codes

This page was built for publication: On the construction 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 Q734287)