scientific article; zbMATH DE number 3801449

Cited in

(53)

Uniform hypergraphs containing no grids
New Construction of Error-Tolerant Pooling Designs
Constructions of optimal sparse r-disjunct matrices via packings
Coding for a Multiple Access OR Channel: a Survey
Almost disjunctive list-decoding codes
Lower bounds for cover-free families
Generalized cover-free families.
Near-sunflowers and focal families
Families of finite sets in which no intersection of sets is covered by the union of s others
Improved upper bounds for the rate of separating and completely separating codes
Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise
Binary representations of underdetermined data and superimposed codes
On the extremal combinatorics of the Hamming space
Generalization of IPP codes and IPP set systems
Traceability codes and their generalizations
Some new bounds for cover-free families
Fast decoding of group testing results from Reed-Solomon d-disjunct matrices
On detecting some defective items in group testing
Almost cover-free codes
Improved algorithms for group testing with inhibitors
Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
On optimal language compression for sets in PSPACE/poly
-almost selectors and their applications
Parity-check codes from disjunct matrices
Deterministic non-adaptive contention resolution on a shared channel
Exact learning from an honest teacher that answers membership queries
Bounds for the number of tests in non-adaptive randomized algorithms for group testing
A survey of cover-free families: constructions, applications, and generalizations
Bounds on the rate of disjunctive codes
Subquadratic non-adaptive threshold group testing
On the upper bound of the size of the \(r\)-cover-free families
On the upper bounds of the minimum number of rows of disjunct matrices
On the complexity of neighbourhood learning in radio networks
Real-valued group testing for quantitative molecular assays
Low-weight superimposed codes and related combinatorial structures: bounds and applications
Optimal Message-Passing with Noisy Beeps
Recursive bounds for perfect hashing
Two new perspectives on multi-stage group testing
Some new bounds for cover-free families through biclique covers
A probabilistic variant of Sperner's theorem and of maximal r-cover free families
Simple Codes and Sparse Recovery with Fast Decoding
scientific article; zbMATH DE number 7650113 (Why is no real title available?)
Coding for a multiple access OR channel: A survey
Optimal message-passing with noisy beeps
Bounds and algorithms for generalized superimposed codes
Probabilistic methods for deriving new lower bounds on the rates of locally thin families and weak superimposed codes
Synthetic sequence design for signal location search
General theory of information transfer: Updated
Linear Time Constructions of Some d-Restriction Problems
Almost optimal cover-free families
On non-binary traceability set systems
Smart elements in combinatorial group testing problems with more defectives
Non-adaptive group testing on graphs with connectivity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4745752)