Generalized cover-free families.
From MaRDI portal
Publication:1428544
DOI10.1016/S0012-365X(03)00287-5zbMath1034.05047OpenAlexW2030083434MaRDI 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
Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (24)
Anonymity in shared symmetric key primitives ⋮ Explicit constructions of separating hash families from algebraic curves over finite fields ⋮ On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks ⋮ Improved constructions for non-adaptive threshold group testing ⋮ Non-adaptive complex group testing with multiple positive sets ⋮ The design of (almost) disjunct matrices by evolutionary algorithms ⋮ On the complexity of neighbourhood learning in radio networks ⋮ Constructions for key distribution patterns ⋮ A survey on nonadaptive group testing algorithms through the angle of decoding ⋮ Edge-colored graphs with applications to homogeneous faults ⋮ Unnamed Item ⋮ Pooling spaces associated with finite geometry ⋮ Biclique cover and local clique cover of graphs ⋮ An upper bound of the number of tests in pooling designs for the error-tolerant complex model ⋮ Non-adaptive Complex Group Testing with Multiple Positive Sets ⋮ An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution ⋮ Threshold and Majority Group Testing ⋮ Group Testing with Multiple Mutually-Obscuring Positives ⋮ Some new bounds for cover-free families through biclique covers ⋮ A class of error-correcting pooling designs over complexes ⋮ Pooling designs for clone library screening in the inhibitor complex model ⋮ Union-intersection-bounded families and their applications ⋮ Comments on ``Distributed symmetric key management for mobile ad hoc networks ⋮ Nonadaptive algorithms for threshold group testing
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
This page was built for publication: Generalized cover-free families.
