29 citations · 52 across the 26 of their papers we have counts for
8 papers · 1 filter
On a Hypergraph Approach to Multistage Group Testing Problems
A. G. D'yachkov, I. V. Vorobyev, N. A. Polyanskii +1
Group testing is a well known search problem that consists in detecting up to defective elements of the set by carrying out tests on properly chosen subset…
Adaptive Learning a Hidden Hypergraph
A. G. D'yachkov, I. V. Vorobyev, N. A. Polyanskii +1
Learning a hidden hypergraph is a natural generalization of the classical group testing problem that consists in detecting unknown hypergraph by carrying out edge-d…
Threshold Decoding for Disjunctive Group Testing
A. G. D'yachkov, I. V. Vorobyev, N. A. Polyanskii +1
Let , be integers and a complex electronic circuit of size is said to be an -active, , and can work as a system block if not more than …
A simple construction of cover-free -code with certain constant weight
A. G. D'yachkov, I. V. Vorobyev, N. A. Polyanskii +1
We give a method of constructing a cover-free -code. For , our construction yields a cover-free -co…
Bounds on the rate of disjunctive codes (in Russian)
A. G. Dyachkov, N. Polyanskii, V. Shchukin +1
A binary code is called a superimposed cover-free -code if the code is identified by the incidence matrix of a family of finite sets in which no intersection of se…
Threshold Disjunctive Codes
A. G. D'yachkov, I. V. Vorobyev, N. A. Polyanskii +1
Let , be integers and a complex electronic circuit of size is said to be an -active, , and can work as a system block if not more than …