Generalized cover-free families.

DOI10.1016/S0012-365X(03)00287-5zbMath1034.05047MaRDI QIDQ1428544

Douglas R. Stinson, Rui Zhong Wei

Publication date: 29 March 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00287-5

zbMATH Keywords

Cover-free family; Probabilistic method

Mathematics Subject Classification ID

05D05: Extremal set theory

05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)

Related Items

Unnamed Item, Threshold and Majority Group Testing, Group Testing with Multiple Mutually-Obscuring Positives, On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks, The design of (almost) disjunct matrices by evolutionary algorithms, Improved constructions for non-adaptive threshold group testing, Non-adaptive complex group testing with multiple positive sets, Pooling designs for clone library screening in the inhibitor complex model, Explicit constructions of separating hash families from algebraic curves over finite fields, On the complexity of neighbourhood learning in radio networks, Pooling spaces associated with finite geometry, An upper bound of the number of tests in pooling designs for the error-tolerant complex model, A class of error-correcting pooling designs over complexes, Comments on ``Distributed symmetric key management for mobile ad hoc networks, Nonadaptive algorithms for threshold group testing, Constructions for key distribution patterns, Biclique cover and local clique cover of graphs, Some new bounds for cover-free families through biclique covers, Edge-colored graphs with applications to homogeneous faults, Union-intersection-bounded families and their applications, A survey on nonadaptive group testing algorithms through the angle of decoding, An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution, Anonymity in shared symmetric key primitives, Non-adaptive Complex Group Testing with Multiple Positive Sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New combinatorial designs and their applications to group testing
• Families of finite sets in which no set is covered by the union of \(r\) others
• Key storage in secure networks
• Families of finite sets in which no set is covered by the union of two others
• Some new results on key distribution patterns and broadcast encryption
• On the upper bound of the size of the \(r\)-cover-free families
• On some methods for unconditionally secure key distribution and broadcast encryption
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Multireceiver authentication codes: Models, bounds, constructions, and extensions
• On key storage in secure networks
• On \(r\)-cover-free families
• Some new bounds for cover-free families
• Interval Packing and Covering in the Boolean Lattice
• Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
• Nonrandom binary superimposed codes
• Explicit constructions of perfect hash families from algebraic curves over finite fields