Key storage in secure networks
Discrete Applied Mathematics
Some new bounds for cover-free families
Journal of Combinatorial Theory Series A
Asymptotic Upper Bound for the Rate of (w, r) Cover-Free Codes
Problems of Information Transmission
Superimposed codes and threshold group testing
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.00 |
A (w, r)-cover-free code is the incidence matrix of a family of sets where no intersection of w members of the family is covered by the union of r others. We obtain a new condition in view of which (w, r)-cover-free codes with a simple structure are optimal. We also introduce (w, r)-cover-free codes with a constraint set.