29 citations · 39 across the 6 of their papers we have counts for
6 papers
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…
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 …
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…
On Multistage 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…
Almost Cover-Free Codes and Designs
Arkadii D'yachkov, Ilya Vorobyev, Nikita Polyanskii +1
An -subset of codewords of a binary code is said to be an {\em -bad} in if the code contains a subset of other codewords such that the conjunction o…
Bounds on the rate of superimposed codes
Arkady D'yachkov, Ilya Vorobyev, Nikita Polianskii +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…