The following pages link to (Q4745752):
Displaying 42 items.
- Almost disjunctive list-decoding codes (Q259899) (← links)
- Improved algorithms for group testing with inhibitors (Q293316) (← links)
- Synthetic sequence design for signal location search (Q378252) (← links)
- Improved constructions for non-adaptive threshold group testing (Q378256) (← links)
- Two new perspectives on multi-stage group testing (Q378258) (← links)
- Uniform hypergraphs containing no grids (Q390731) (← links)
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others (Q696905) (← links)
- A probabilistic variant of Sperner's theorem and of maximal \(r\)-cover free families (Q785827) (← links)
- On the complexity of neighbourhood learning in radio networks (Q896133) (← links)
- General theory of information transfer: Updated (Q947076) (← links)
- Coding for a multiple access OR channel: A survey (Q947083) (← links)
- On the upper bounds of the minimum number of rows of disjunct matrices (Q1024738) (← links)
- On the upper bound of the size of the \(r\)-cover-free families (Q1328402) (← links)
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. (Q1426451) (← links)
- Generalized cover-free families. (Q1428544) (← links)
- Some new bounds for cover-free families through biclique covers (Q1759404) (← links)
- On the extremal combinatorics of the Hamming space (Q1894014) (← links)
- Some new bounds for cover-free families (Q1976329) (← links)
- Real-valued group testing for quantitative molecular assays (Q2170137) (← links)
- Generalization of IPP codes and IPP set systems (Q2190902) (← links)
- Traceability codes and their generalizations (Q2190905) (← links)
- On non-binary traceability set systems (Q2200518) (← links)
- Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise (Q2229581) (← links)
- Pseudo-random graphs and bit probe schemes with one-sided error (Q2254500) (← links)
- Bounds on the rate of disjunctive codes (Q2262991) (← links)
- Low-weight superimposed codes and related combinatorial structures: bounds and applications (Q2285161) (← links)
- On optimal language compression for sets in PSPACE/poly (Q2354585) (← links)
- Almost cover-free codes (Q2364463) (← links)
- Non-adaptive group testing on graphs with connectivity (Q2424809) (← links)
- Lower bounds for cover-free families (Q2629487) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Deterministic non-adaptive contention resolution on a shared channel (Q2677825) (← links)
- Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
- $$\epsilon $$-Almost Selectors and Their Applications (Q2947885) (← links)
- Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing (Q3297759) (← links)
- Coding for a Multiple Access OR Channel: a Survey (Q3439269) (← links)
- Smart elements in combinatorial group testing problems with more defectives (Q5121559) (← links)
- (Q5875503) (← links)
- Near-sunflowers and focal families (Q6076184) (← links)
- Simple Codes and Sparse Recovery with Fast Decoding (Q6101016) (← links)
- Bounds and algorithms for generalized superimposed codes (Q6161430) (← links)
- Improved upper bounds for the rate of separating and completely separating codes (Q6173461) (← links)
