Asymptotic upper bound for the rate of \((w,r)\) cover-free codes

DOI10.1023/B:PRIT.0000011270.09033.8fzbMath1096.94534OpenAlexW2010061778MaRDI QIDQ2388455

Vladimir Lebedev

Publication date: 14 September 2005

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

Full work available at URL: https://doi.org/10.1023/b:prit.0000011270.09033.8f

zbMATH Keywords

binary codecover-free family

Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial codes (94B25)

Related Items

Almost cover-free codes ⋮ Improved upper bounds for the rate of separating and completely separating codes ⋮ A note on the uniqueness of \((w, r)\) cover-free codes ⋮ Asymptotic bounds for the rate of colored superimposed codes ⋮ Cover-free codes and separating system codes ⋮ Bounds on the rate of separating codes ⋮ Threshold and Majority Group Testing ⋮ Superimposed Codes and Threshold Group Testing ⋮ Some new bounds for cover-free families through biclique covers ⋮ Bounds on the rate of disjunctive codes