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

DOI10.1134/S0032946009010049zbMath1173.94457OpenAlexW1992271960MaRDI QIDQ734287

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 codes (94B25) Combinatorial aspects of packing and covering (05B40)

Related Items (2)

Almost cover-free codes ⋮ Bounds on the rate of disjunctive codes

Cites Work

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

This page was built for publication: On the construction of \((w,r)\) cover-free codes