Key storage in secure networks
Discrete Applied Mathematics
Some new bounds for cover-free families
Journal of Combinatorial Theory Series A
On the Optimality of Trivial (w, r)-Cover-Free Codes
Problems of Information Transmission
Asymptotic bounds for the rate of colored superimposed codes
Problems of Information Transmission
Separating codes and a new combinatorial search model
Problems of Information Transmission
Threshold and majority group testing
Information Theory, Combinatorics, and Search Theory
Superimposed codes and threshold group testing
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.00 |
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.