Some new bounds for cover-free families
Journal of Combinatorial Theory Series A
Guessing secrets efficiently via list decoding
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Problems of Information Transmission
Asymptotic Upper Bound for the Rate of (w, r) Cover-Free Codes
Problems of Information Transmission
Codes for Copyright Protection: The Case of Two Pirates
Problems of Information Transmission
Nonadaptive algorithms for threshold group testing
Discrete Applied Mathematics
General Theory of Information Transfer and Combinatorics
Threshold and majority group testing
Information Theory, Combinatorics, and Search Theory
Superimposed codes and threshold group testing
Information Theory, Combinatorics, and Search Theory
Group testing problem with two defectives
Problems of Information Transmission
| Hi-index | 0.00 |
We propose a new group testing model, which is related to separating codes and cover-free codes.