51 citations · 56 across the 13 of their papers we have counts for
13 papers
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…
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…