Almost cover-free codes and designs

DOI10.1007/s10623-016-0279-3zbMath1364.94672arXiv1410.8566OpenAlexW3177260100MaRDI QIDQ510471

Vladislav Shchukin, Ilya Vorobyev, Arkadii G. D'yachkov, Nikita Polyanskii

Publication date: 10 February 2017

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.8566

zbMATH Keywords

capacitydesignsalmost cover-free codesrandom coding bound

Mathematics Subject Classification ID

Bounds on codes (94B65) Combinatorial codes (94B25)

Related Items (2)

Optimal Message-Passing with Noisy Beeps ⋮ Almost cover-free codes and designs

Cites Work

• Unnamed Item
• Symmetric disjunctive list-decoding codes
• Almost cover-free codes and designs
• Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
• Key storage in secure networks
• Families of finite sets in which no set is covered by the union of two others
• The separating property of random matrices
• Sets pooling designs
• Multiple-access hyperchannel
• Bounds on the rate of disjunctive codes
• Nonrandom binary superimposed codes
• Information Theory

This page was built for publication: Almost cover-free codes and designs