Arkadii G. D'yachkov

According to our database1, Arkadii G. D'yachkov authored at least 43 papers between 2000 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
New Lower Bounds on the Fraction of Correctable Errors under List Decoding in Combinatorial Binary Communication Channels.
Probl. Inf. Transm., 2021

2019
Hypothesis Test for Bounds on the Size of Random Defective Set.
IEEE Trans. Signal Process., 2019

Separable Codes for the Symmetric Multiple-Access Channel.
IEEE Trans. Inf. Theory, 2019

2017
Almost cover-free codes and designs.
Des. Codes Cryptogr., 2017

Symmetric disjunctive list-decoding codes.
Des. Codes Cryptogr., 2017

Cover-free codes and separating system codes.
Des. Codes Cryptogr., 2017

Bounds for Signature Codes.
CoRR, 2017

Hypothesis test for upper bound on the size of random defective set.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Erratum to: "Bounds on the rate of disjunctive codes".
Probl. Inf. Transm., 2016

Adaptive Learning a Hidden Hypergraph.
CoRR, 2016

Threshold Decoding for Disjunctive Group Testing.
CoRR, 2016

A simple construction of cover-free (s, ℓ)-code with certain constant weight.
CoRR, 2016

Threshold Disjunctive Codes.
CoRR, 2016

Bounds on the rate of disjunctive codes (in Russian).
CoRR, 2016

On a hypergraph approach to multistage group testing problems.
Proceedings of the IEEE International Symposium on Information Theory, 2016

On multistage learning a hidden hypergraph.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Almost disjunctive list-decoding codes.
Probl. Inf. Transm., 2015

2014
Bounds on the rate of disjunctive codes.
Probl. Inf. Transm., 2014

DNA codes for nonadditive stem similarity.
Probl. Inf. Transm., 2014

Almost Cover-Free Codes.
CoRR, 2014

Almost Disjunctive List-Decoding Codes.
CoRR, 2014

Two Models of Nonadaptive Group Testing for Designing Screening Experiments.
CoRR, 2014

Lectures on Designing Screening Experiments.
CoRR, 2014

Bounds on the rate of superimposed codes.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Superimposed Codes and Threshold Group Testing.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2011
DNA codes for generalized stem similarity.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
On critical relative distance of DNA codes for additive stem similarity.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
DNA codes for additive stem similarity.
Probl. Inf. Transm., 2009

2008
Random Coding Bounds for DNA codes based on Fibonacci ensembles of DNA sequences.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Free Energy Gap and Statistical Thermodynamic Fidelity of DNA Codes.
J. Comput. Biol., 2007

DNA Codes Based on Stem Similarities Between DNA Sequences.
Proceedings of the DNA Computing, 13th International Meeting on DNA Computing, 2007

2006
Remark on "On DNA Codes" published in <i>Probl. Peredachi Inf.</i>, 2005, no. 4.
Probl. Inf. Transm., 2006

New t-Gap Insertion-Deletion-Like Metrics for DNA Hybridization Thermodynamic Modeling.
J. Comput. Biol., 2006

2005
On DNA Codes.
Probl. Inf. Transm., 2005

A Construction of Pooling Designs with Some Happy Surprises.
J. Comput. Biol., 2005

Reverse-Complement Similarity Codes.
Electron. Notes Discret. Math., 2005

New results on DNA codes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Partition codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

A Weighted Insertion-Deletion Stacked Pair Thermodynamic Metric for DNA Codes.
Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

2003
Exordium for DNA Codes.
J. Comb. Optim., 2003

2002
Families of Finite Sets in which No Intersection of Sets Is Covered by the Union of s Others.
J. Comb. Theory A, 2002

2000
On similarity codes.
IEEE Trans. Inf. Theory, 2000

New constructions of superimposed codes.
IEEE Trans. Inf. Theory, 2000


  Loading...