29 citations · 41 across the 14 of their papers we have counts for
14 papers · 1 filter
Hypothesis Test for Bounds on the Size of Random Defective Set
A. G. D'yachkov, N. A. Polyanskii, V. Yu. Shchukin +1
The conventional model of disjunctive group testing assumes that there are several defective elements (or defectives) among a large population, and a group test yields the positive…
Separable Codes for the Symmetric Multiple-Access Channel
A. G. Dyachkov, N. Polyanskii, V. Shchukin +1
A binary matrix is called an s-separable code for the disjunctive multiple-access channel (disj-MAC) if Boolean sums of sets of s columns are all distinct. The well-known issue of…
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 …
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…
Symmetric Disjunctive List-Decoding Codes
Arkadii D'yachkov, Ilya Vorobyev, Nikita Polyanskii +1
A binary code is said to be a disjunctive list-decoding -code (LD -code), , , if the code is identified by the incidence matrix of a family of finite se…
Almost Disjunctive List-Decoding Codes
A. G. Dyachkov, I. V. Vorobyev, N. A. Polyanskii +1
A binary code is said to be a disjunctive list-decoding -code, , , (briefly, LD -code) if the code is identified by the incidence matrix of a family of fini…
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…