scientific article; zbMATH DE number 4135867
From MaRDI portal
Publication:3469037
Recommendations
Cited in
(29)- Upper bounds for the cardinality of s-distances codes
- Non-adaptive group testing in the presence of errors
- Universal code families
- Probabilistic existence theorems in group testing
- Generalized cover-free families.
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Pooling spaces and non-adaptive pooling designs
- Union-intersection-bounded families and their applications
- Random and quasi-random designs in group testing
- Bounds on the rate of disjunctive codes
- List decoding for a multiple access hyperchannel
- Strict group testing and the set basis problem
- Combinatorics of singly-repairable families
- Almost disjunctive list-decoding codes
- Strongly separable matrices for nonadaptive combinatorial group testing
- Linear Time Constructions of Some d-Restriction Problems
- Synthetic sequence design for signal location search
- Superimposed concatenated codes (Corresp.)
- An improved upper bound of the rate of Euclidean superimposed codes
- A new strongly competitive group testing algorithm with small sequentiality
- Symmetric disjunctive list-decoding codes
- Set-codes with small intersections and small discrepancies
- New construction of \((p, d, r)\)-code from finite set \([n]\)
- Pharmaceutical Applications of a Multi-Stage Group Testing Method
- Almost optimal cover-free families
- A survey of cover-free families: constructions, applications, and generalizations
- Probabilistic methods for deriving new lower bounds on the rates of locally thin families and weak superimposed codes
- Families of finite sets in which no intersection of sets is covered by the union of s others
- On the complexity of neighbourhood learning in radio networks
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 Q3469037)
