scientific article; zbMATH DE number 3801449

Cited in

(48)

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

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)