default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArkadii G. D'yachkov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j21]Arkady G. D'yachkov, D. Yu. Goshkoder:
New Lower Bounds on the Fraction of Correctable Errors under List Decoding in Combinatorial Binary Communication Channels. Probl. Inf. Transm. 57(4): 301-320 (2021)
2010 – 2019
- 2019
- [j20]Arkadii G. D'yachkov, Nikita Polyanskii
, Vladislav Yu. Shchukin, Ilya Vorobyev:
Separable Codes for the Symmetric Multiple-Access Channel. IEEE Trans. Inf. Theory 65(6): 3738-3750 (2019) - [j19]Arkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev:
Hypothesis Test for Bounds on the Size of Random Defective Set. IEEE Trans. Signal Process. 67(22): 5775-5784 (2019) - 2018
- [c17]Arkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev:
Separable Codes for the Symmetric Multiple-Access Channel. ISIT 2018: 291-295 - 2017
- [j18]Arkadii G. D'yachkov, Ilya Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Cover-free codes and separating system codes. Des. Codes Cryptogr. 82(1-2): 197-209 (2017) - [j17]Arkadii G. D'yachkov, Ilya Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Symmetric disjunctive list-decoding codes. Des. Codes Cryptogr. 82(1-2): 211-229 (2017) - [j16]Arkadii G. D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin:
Almost cover-free codes and designs. Des. Codes Cryptogr. 82(1-2): 231-247 (2017) - [c16]Arkadii G. D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin:
Hypothesis test for upper bound on the size of random defective set. ISIT 2017: 978-982 - [i17]Arkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev:
Bounds for Signature Codes. CoRR abs/1701.06085 (2017) - [i16]Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Hypothesis Test for Upper Bound on the Size of Random Defective Set. CoRR abs/1701.06201 (2017) - 2016
- [j15]Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyansky, Vladislav Yu. Shchukin:
Erratum to: "Bounds on the rate of disjunctive codes". Probl. Inf. Transm. 52(2): 200 (2016) - [c15]Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
On multistage learning a hidden hypergraph. ISIT 2016: 1178-1182 - [c14]Arkady G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
On a hypergraph approach to multistage group testing problems. ISIT 2016: 1183-1191 - [i15]Arkady G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
On a Hypergraph Approach to Multistage Group Testing Problems. CoRR abs/1601.06704 (2016) - [i14]Arkady G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
On Multistage Learning a Hidden Hypergraph. CoRR abs/1601.06705 (2016) - [i13]Arkady G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Threshold Disjunctive Codes. CoRR abs/1601.06709 (2016) - [i12]Arkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev:
Bounds on the rate of disjunctive codes (in Russian). CoRR abs/1605.05363 (2016) - [i11]Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
A simple construction of cover-free (s, ℓ)-code with certain constant weight. CoRR abs/1605.06847 (2016) - [i10]Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Threshold Decoding for Disjunctive Group Testing. CoRR abs/1607.00502 (2016) - [i9]Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Adaptive Learning a Hidden Hypergraph. CoRR abs/1607.00507 (2016) - [i8]Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
On a Hypergraph Approach to Multistage Group Testing Problems. CoRR abs/1607.00511 (2016) - 2015
- [j14]Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyansky, Vladislav Yu. Shchukin:
Almost disjunctive list-decoding codes. Probl. Inf. Transm. 51(2): 110-131 (2015) - [c13]Arkady G. D'yachkov, Ilya V. Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin:
Symmetric disjunctive list-decoding codes. ISIT 2015: 2236-2240 - [c12]Arkady G. D'yachkov, Ilya V. Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin:
Cover-free codes and separating system codes. ISIT 2015: 2894-2898 - [c11]Arkady G. D'yachkov, Ilya V. Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin:
Almost cover-free codes and designs. ISIT 2015: 2899-2903 - 2014
- [j13]Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyansky, Vladislav Yu. Shchukin:
Bounds on the rate of disjunctive codes. Probl. Inf. Transm. 50(1): 27-56 (2014) - [j12]Arkadii G. D'yachkov, A. N. Kuzina, N. A. Polyansky, Anthony J. Macula, Vyacheslav V. Rykov:
DNA codes for nonadditive stem similarity. Probl. Inf. Transm. 50(3): 247-269 (2014) - [c10]Arkadii G. D'yachkov, Ilya Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Bounds on the rate of superimposed codes. ISIT 2014: 2341-2345 - [i7]Arkadii G. D'yachkov, Vyacheslav V. Rykov, Christian Deppe, Vladimir S. Lebedev:
Superimposed Codes and Threshold Group Testing. CoRR abs/1401.7485 (2014) - [i6]Arkadii G. D'yachkov:
Lectures on Designing Screening Experiments. CoRR abs/1401.7505 (2014) - [i5]Arkadii G. D'yachkov, Anthony J. Macula, David C. Torney, Pavel A. Vilenkin:
Two Models of Nonadaptive Group Testing for Designing Screening Experiments. CoRR abs/1401.7508 (2014) - [i4]Arkadii G. D'yachkov, Ilya Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Almost Disjunctive List-Decoding Codes. CoRR abs/1407.2482 (2014) - [i3]Arkadii G. D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin:
Symmetric Disjunctive List-Decoding Codes. CoRR abs/1410.8385 (2014) - [i2]Arkadii G. D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav Yu. Shchukin:
Almost Cover-Free Codes. CoRR abs/1410.8566 (2014) - 2013
- [c9]Arkadii G. D'yachkov, Vyacheslav V. Rykov, Christian Deppe, Vladimir S. Lebedev:
Superimposed Codes and Threshold Group Testing. Information Theory, Combinatorics, and Search Theory 2013: 509-533 - 2011
- [c8]Arkadii G. D'yachkov, Julia Volkova, Nikita Polyanskii:
DNA codes for generalized stem similarity. ISIT 2011: 1564-1568 - 2010
- [c7]Arkadii G. D'yachkov, A. N. Voronina, Anthony J. Macula, Thomas E. Renz, Vyacheslav V. Rykov:
On critical relative distance of DNA codes for additive stem similarity. ISIT 2010: 1325-1329 - [i1]Arkadii G. D'yachkov, A. N. Voronina, Anthony J. Macula, Thomas E. Renz, Vyacheslav V. Rykov:
On Critical Relative Distance of DNA Codes for Additive Stem Similarity. CoRR abs/1001.1278 (2010)
2000 – 2009
- 2009
- [j11]Arkadii G. D'yachkov, A. N. Voronina:
DNA codes for additive stem similarity. Probl. Inf. Transm. 45(2): 124-144 (2009) - 2008
- [c6]Arkadii G. D'yachkov, Anthony J. Macula, Thomas E. Renz, Vyacheslav V. Rykov:
Random Coding Bounds for DNA codes based on Fibonacci ensembles of DNA sequences. ISIT 2008: 2292-2296 - 2007
- [j10]Morgan A. Bishop, Arkadii G. D'yachkov, Anthony J. Macula, Thomas E. Renz, Vyacheslav V. Rykov:
Free Energy Gap and Statistical Thermodynamic Fidelity of DNA Codes. J. Comput. Biol. 14(8): 1088-1104 (2007) - [c5]Arkadii G. D'yachkov, Anthony J. Macula, Vyacheslav V. Rykov, Vladimir Ufimtsev:
DNA Codes Based on Stem Similarities Between DNA Sequences. DNA 2007: 146-151 - 2006
- [j9]Arkadii G. D'yachkov, Anthony J. Macula, Wendy K. Pogozelski, Thomas E. Renz, Vyacheslav V. Rykov, David C. Torney:
New t-Gap Insertion-Deletion-Like Metrics for DNA Hybridization Thermodynamic Modeling. J. Comput. Biol. 13(4): 866-881 (2006) - [j8]Arkadii G. D'yachkov, Pavel A. Vilenkin, I. K. Ismagilov, R. S. Sarbaev, Anthony J. Macula, David C. Torney, Scott White:
Remark on "On DNA Codes" published in Probl. Peredachi Inf., 2005, no. 4. Probl. Inf. Transm. 42(2): 166 (2006) - [c4]Arkadii G. D'yachkov, David C. Torney, Pavel A. Vilenkin, Scott White:
Reverse-Complement Similarity Codes. GTIT-C 2006: 814-830 - 2005
- [j7]Arkadii G. D'yachkov, David C. Torney, Pavel A. Vilenkin, Scott White:
Reverse-Complement Similarity Codes. Electron. Notes Discret. Math. 21: 281-282 (2005) - [j6]Arkadii G. D'yachkov, Frank K. Hwang, Anthony J. Macula, Pavel A. Vilenkin, Chih-Wen Weng:
A Construction of Pooling Designs with Some Happy Surprises. J. Comput. Biol. 12(8): 1129-1136 (2005) - [j5]Arkadii G. D'yachkov, Pavel A. Vilenkin, I. K. Ismagilov, R. S. Sarbaev, Anthony J. Macula, David C. Torney, Scott White:
On DNA Codes. Probl. Inf. Transm. 41(4): 349-367 (2005) - [c3]Arkady G. D'yachkov, Anthony J. Macula, Thomas E. Renz, Pavel A. Vilenkin, I. K. Ismagilov:
New results on DNA codes. ISIT 2005: 283-287 - 2004
- [c2]Arkadii G. D'yachkov, Anthony J. Macula, Wendy K. Pogozelski, Thomas E. Renz, Vyacheslav V. Rykov, David C. Torney:
A Weighted Insertion-Deletion Stacked Pair Thermodynamic Metric for DNA Codes. DNA 2004: 90-103 - [c1]Arkadii G. D'yachkov, Vyacheslav V. Rykov, David C. Torney, Sergey Yekhanin:
Partition codes. ISIT 2004: 256 - 2003
- [j4]Arkadii G. D'yachkov, Péter L. Erdös, Anthony J. Macula, Vyacheslav V. Rykov, David C. Torney, Chang-Shung Tung, Pavel A. Vilenkin, P. Scott White:
Exordium for DNA Codes. J. Comb. Optim. 7(4): 369-379 (2003) - 2002
- [j3]Arkadii G. D'yachkov, Pavel A. Vilenkin, David C. Torney, Anthony J. Macula:
Families of Finite Sets in which No Intersection of Sets Is Covered by the Union of s Others. J. Comb. Theory A 99(2): 195-218 (2002) - 2000
- [j2]Arkadii G. D'yachkov, Anthony J. Macula, Vyacheslav V. Rykov:
New constructions of superimposed codes. IEEE Trans. Inf. Theory 46(1): 284-290 (2000) - [j1]Arkadii G. D'yachkov, David C. Torney:
On similarity codes. IEEE Trans. Inf. Theory 46(4): 1558-1564 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
