51 citations · 56 across the 13 of their papers we have counts for
6 papers · 1 filter
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…
Two Models of Nonadaptive Group Testing for Designing Screening Experiments
A. G. D'yachkov, A. J. Macula, D. C. Torney +1
We discuss two non-standard models of nonadaptive combinatorial search which develop the conventional disjunct search model for a small number of defective elements contained in a…
Lectures on Designing Screening Experiments
Arkadii G. D'yachkov
Designing Screening Experiments (DSE) is a class of information - theoretical models for multiple - access channels (MAC). We discuss the combinatorial model of DSE called a disjun…
Lectures on DNA Codes
A. Dyachkov
For -ary -sequences, we develop the concept of similarity functions that can be used (for ) to model a thermodynamic similarity on DNA sequences. A similarity function i…
Superimposed Codes and Threshold Group Testing
A. D'yachkov, V. Rykov, C. Deppe +1
We will discuss superimposed codes and non-adaptive group testing designs arising from the potentialities of compressed genotyping models in molecular biology. The given paper was…