scientific article; zbMATH DE number 3831842
From MaRDI portal
Publication:3039244
Cited in
(24)- Non-adaptive group testing in the presence of errors
- Probabilistic existence theorems in group testing
- Distributed broadcast in radio networks of unknown topology.
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
- Random and quasi-random designs in group testing
- Bounds on the rate of disjunctive codes
- Low-weight superimposed codes and related combinatorial structures: bounds and applications
- Identifying defective network components through restricted group testing
- List decoding for a multiple access hyperchannel
- Combinatorial search in two and more rounds
- Strict group testing and the set basis problem
- Almost disjunctive list-decoding codes
- Coding for a Multiple Access OR Channel: a Survey
- Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing
- Non-adaptive complex group testing with multiple positive sets
- Symmetric disjunctive list-decoding codes
- Fast nonadaptive deterministic algorithm for conflict resolution in a dynamic multiple-access channel
- Optimal superimposed codes and designs for Renyi's search model
- scientific article; zbMATH DE number 7758315 (Why is no real title available?)
- Improved bounds for group testing in arbitrary hypergraphs
- Families of finite sets in which no intersection of sets is covered by the union of s others
- Deterministic recurrent communication in restricted sensor networks
- Coding for a multiple access OR channel: A survey
- Nonadaptive group testing with lies: probabilistic existence theorems
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 Q3039244)