A survey of cover-free families: constructions, applications, and generalizations

DOI10.1007/978-3-031-48679-1_11MaRDI QIDQ6613366

Publication date: 2 October 2024

Linear codes (general theory) (94B05) Other designs, configurations (05B30) Triple systems (05B07) Combinatorial aspects of packing and covering (05B40)

Related Items (2)

Detecting arrays for effects of multiple interacting factors ⋮ An efficient algorithm for group testing with runlength constraints

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Packing arrays
Explicit constructions of separating hash families from algebraic curves over finite fields
Families of finite sets in which no set is covered by the union of $r$ others
Key storage in secure networks
Orthogonal arrays. Theory and applications
Group testing for consecutive positives
On the upper bound of the size of the $r$-cover-free families
A simple construction of $d$-disjunct matrices with certain constant weights
Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
Generalized cover-free families.
Ein Satz über Untermengen einer endlichen Menge.
Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
Efficient unbounded fault-tolerant aggregate signatures using nested cover-free families
On $k$-strong conflict-free multicoloring
Cover-free families and topology-transparent scheduling for MANETs
Ad-hoc, mobile, and wireless networks. Second international conference ADHOC-NOW 2003, Montreal, Canada, October 8--10, 2003. Proceedings.
On key storage in secure networks
On $r$-cover-free families
Optimal pooling designs with error detection
Some new bounds for cover-free families
Structure-aware combinatorial group testing: a new method for pandemic screening
Modification tolerant signature schemes: location and correction
Nested cover-free families for unbounded fault-tolerant aggregate signatures
Bounds on the rate of disjunctive codes
Embedding cover-free families and cryptographical applications
Low-weight superimposed codes and related combinatorial structures: bounds and applications
Locating modifications in signed data for partial data integrity
Erratum to: ``Bounds on the rate of disjunctive codes
Transport schemes for topology-transparent scheduling
Distributing the encryption and decryption of a block cipher
Lower bounds for cover-free families
Interval Packing and Covering in the Boolean Lattice
Fault-Tolerant Aggregate Signatures
Two-Dimensional Representation of Cover Free Families and Its Applications: Short Signatures and More
Variable Weight Sequences for Adaptive Scheduled Access in MANETs
Linear Time Constructions of Some $$d$$-Restriction Problems
Redistribution of Mechanical Secret Shares
Short Signatures from Weaker Assumptions
Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
Polynomial Codes Over Certain Finite Fields
Constructions of 2-cover-free families and related separating hash families
Bounded CCA2-Secure Encryption
A constructive proof of the general lovász local lemma
Indexing Information for Data Forensics
Born again group testing: Multiaccess communications
Locality in Distributed Graph Algorithms
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
New constructions of superimposed codes
Combinatorial properties of frameproof and traceability codes
Variable strength covering arrays
$\epsilon $ -Almost Selectors and Their Applications to Multiple-Access Communication
Group Testing and Batch Verification
An Optimization Problem Related to Bloom Filters with Bit Patterns
Group Testing: An Information Theory Perspective
Nearly Optimal Sparse Group Testing
Explicit Nonadaptive Combinatorial Group Testing Schemes
Almost Optimal Cover-Free Families
Nonrandom binary superimposed codes
Bounds on Traceability Schemes
Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
Selected Areas in Cryptography
Applied Cryptography and Network Security
A new kind of selectors and their applications to conflict resolution in wireless multichannels networks
Bounds and algorithms for generalized superimposed codes

This page was built for publication: A survey of cover-free families: constructions, applications, and generalizations