scientific article; zbMATH DE number 3801449
From MaRDI portal
Publication:4745752
zbMATH Open0507.94013MaRDI QIDQ4745752FDOQ4745752
Vyacheslav V. Rykov, Arkadii G. D'yachkov
Publication date: 1982
Title of this publication is not available (Why is that?)
Cited In (50)
- Uniform hypergraphs containing no grids
- New Construction of Error-Tolerant Pooling Designs
- 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
- Improved upper bounds for the rate of separating and completely separating codes
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
- Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise
- 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
- On detecting some defective items in group testing
- Almost cover-free codes
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
- Improved algorithms for group testing with inhibitors
- On optimal language compression for sets in PSPACE/poly
- Pseudo-random graphs and bit probe schemes with one-sided error
- Deterministic non-adaptive contention resolution on a shared channel
- Exact learning from an honest teacher that answers membership queries
- A survey of cover-free families: constructions, applications, and generalizations
- Subquadratic non-adaptive threshold group testing
- Bounds on the rate of disjunctive codes
- 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
- Almost Optimal Cover-Free Families
- Real-valued group testing for quantitative molecular assays
- Optimal Message-Passing with Noisy Beeps
- Recursive bounds for perfect hashing
- $$\epsilon $$-Almost Selectors and Their Applications
- Low-weight superimposed codes and related combinatorial structures: bounds and applications
- Two new perspectives on multi-stage group testing
- Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing
- Simple Codes and Sparse Recovery with Fast Decoding
- Some new bounds for cover-free families through biclique covers
- A probabilistic variant of Sperner's theorem and of maximal \(r\)-cover free families
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounds and algorithms for generalized superimposed codes
- Coding for a multiple access OR channel: A survey
- Linear Time Constructions of Some $$d$$-Restriction Problems
- Improved constructions for non-adaptive threshold group testing
- Synthetic sequence design for signal location search
- General theory of information transfer: Updated
- 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)
