Asymptotic bounds for the rate of colored superimposed codes

DOI10.1134/S003294600802004XzbMath1447.94067OpenAlexW2066608893MaRDI QIDQ5121240

Vladimir Lebedev

Publication date: 11 September 2020

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

Full work available at URL: http://mathnet.ru/eng/ppi1270

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Cites Work

• Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
• Key storage in secure networks
• Some new bounds for cover-free families
• Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
• On optimal superimposed codes

This page was built for publication: Asymptotic bounds for the rate of colored superimposed codes