Abstract
A binary code is called a (w, r) cover-free code if it is the incidence matrix of a family of sets where the intersection of any w of the sets is not covered by the union of any other r sets. Such a family is called a (w, r) cover-free family. We obtain a new recurrent inequality for the rate of (w, r) cover-free codes, which improves previously known upper bounds on the rate.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lebedev, V.S. Asymptotic Upper Bound for the Rate of (w, r) Cover-Free Codes. Problems of Information Transmission 39, 317–323 (2003). https://doi.org/10.1023/B:PRIT.0000011270.09033.8f
Issue Date:
DOI: https://doi.org/10.1023/B:PRIT.0000011270.09033.8f