Almost cover-free codes

DOI10.1134/S0032946016020046zbMath1369.94599MaRDI QIDQ2364463

Nikita Polyanskii

Publication date: 21 July 2017

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

zbMATH Keywords

almost cover-free (ACF) codelower and upper bound for capacity

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• Almost disjunctive list-decoding codes
• Cover-free codes and separating system codes
• Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
• On the construction of \((w,r)\) cover-free codes
• Key storage in secure networks
• Multiple-access hyperchannel
• Bounds on the rate of disjunctive codes
• Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
• Nonrandom binary superimposed codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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