scientific article; zbMATH DE number 3801449
From MaRDI portal
Publication:4745752
zbMath0507.94013MaRDI QIDQ4745752
Vyacheslav V. Rykov, Arkadii G. D'yachkov
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (48)
On the upper bound of the size of the \(r\)-cover-free families ⋮ Almost cover-free codes ⋮ Almost Optimal Cover-Free Families ⋮ Improved algorithms for group testing with inhibitors ⋮ Lower bounds for cover-free families ⋮ On the extremal combinatorics of the Hamming space ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Real-valued group testing for quantitative molecular assays ⋮ Synthetic sequence design for signal location search ⋮ Improved constructions for non-adaptive threshold group testing ⋮ Two new perspectives on multi-stage group testing ⋮ Uniform hypergraphs containing no grids ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ $$\epsilon $$-Almost Selectors and Their Applications ⋮ Deterministic non-adaptive contention resolution on a shared channel ⋮ Near-sunflowers and focal families ⋮ Generalization of IPP codes and IPP set systems ⋮ Traceability codes and their generalizations ⋮ Simple Codes and Sparse Recovery with Fast Decoding ⋮ On the complexity of neighbourhood learning in radio networks ⋮ Non-adaptive group testing on graphs with connectivity ⋮ Bounds and algorithms for generalized superimposed codes ⋮ Unnamed Item ⋮ Improved upper bounds for the rate of separating and completely separating codes ⋮ On non-binary traceability set systems ⋮ Optimal Message-Passing with Noisy Beeps ⋮ Smart elements in combinatorial group testing problems with more defectives ⋮ Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. ⋮ Generalized cover-free families. ⋮ Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing ⋮ Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise ⋮ Some new bounds for cover-free families ⋮ General theory of information transfer: Updated ⋮ Coding for a multiple access OR channel: A survey ⋮ New Construction of Error-Tolerant Pooling Designs ⋮ Pseudo-random graphs and bit probe schemes with one-sided error ⋮ 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 ⋮ Bounds on the rate of disjunctive codes ⋮ Recursive bounds for perfect hashing ⋮ Subquadratic non-adaptive threshold group testing ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ On the upper bounds of the minimum number of rows of disjunct matrices ⋮ Unnamed Item ⋮ A probabilistic variant of Sperner's theorem and of maximal \(r\)-cover free families ⋮ Coding for a Multiple Access OR Channel: a Survey ⋮ On optimal language compression for sets in PSPACE/poly ⋮ Almost disjunctive list-decoding codes
This page was built for publication:
