On a Bound of Cover-Free Families

Authors:
X. Ma;R. Wei
Affiliations:
Department of Mathematics, Suzhou University, Suzhou, 215006, China;Department of Computer Science, Lakehead University, Thunder Bay, Ontario, P7B 5E1 Canada wei@ccc.cs.lakeheadu.ca
Venue:
Designs, Codes and Cryptography
Year:
2004

Key storage in secure networks

Discrete Applied Mathematics
On the upper bound of the size of the r-cover-free families

Journal of Combinatorial Theory Series A
On r-cover-free families

Journal of Combinatorial Theory Series A
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes

SIAM Journal on Discrete Mathematics
On codes with the identifiable parent property

Journal of Combinatorial Theory Series A
Non-adaptive group testing in the presence of errors

Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
Some new bounds for cover-free families

Journal of Combinatorial Theory Series A
Tracing Traitors

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Collusion-Secure Fingerprinting for Digital Data (Extended Abstract)

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Tracing traitors

IEEE Transactions on Information Theory
Combinatorial properties of frameproof and traceability codes

IEEE Transactions on Information Theory

Hi-index	0.00

In this paper, we use refined Stirling formulas to determine a bound of cover-free families given by Stinson et al. [31].