Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
D'yachkov, Arkadii Georgievich
(1944–2021)

Statistics Math-Net.Ru
Total publications: 28
Scientific articles: 27
Presentations: 4

Number of views:
This page:1952
Abstract pages:8161
Full texts:3039
References:293
Professor
Doctor of physico-mathematical sciences (1985)
Website: http://new.math.msu.su/department/probab/staff/dyachkov.html

https://www.mathnet.ru/eng/person30440
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/189989

Publications in Math-Net.Ru Citations
2021
1. A. G. D'yachkov, D. Yu. Goshkoder, “New lower bounds on the fraction of correctable errors under list decoding in combinatorial binary communication channels”, Probl. Peredachi Inf., 57:4 (2021),  3–23  mathnet; Problems Inform. Transmission, 57:4 (2021), 301–320  isi  scopus 1
2016
2. A. G. D'yachkov, I. V. Vorob'ev, N. A. Polyansky, V. Yu. Shchukin, “Erratum to: “Bounds on the rate of disjunctive codes” [Problems of Information Transmission 50, 27 (2014)]”, Probl. Peredachi Inf., 52:2 (2016),  111  mathnet  mathscinet; Problems Inform. Transmission, 52:2 (2016), 200  isi  scopus 6
2015
3. A. G. D'yachkov, I. V. Vorob'ev, N. A. Polyansky, V. Yu. Shchukin, “Almost disjunctive list-decoding codes”, Probl. Peredachi Inf., 51:2 (2015),  27–49  mathnet  elib; Problems Inform. Transmission, 51:2 (2015), 110–131  isi  scopus 11
2014
4. A. G. D'yachkov, A. N. Kuzina, N. A. Polyansky, A. Macula, V. V. Rykov, “DNA codes for nonadditive stem similarity”, Probl. Peredachi Inf., 50:3 (2014),  51–75  mathnet; Problems Inform. Transmission, 50:3 (2014), 247–269  isi  scopus 2
5. A. G. D'yachkov, I. V. Vorob'ev, N. A. Polyansky, V. Yu. Shchukin, “Bounds on the rate of disjunctive codes”, Probl. Peredachi Inf., 50:1 (2014),  31–63  mathnet; Problems Inform. Transmission, 50:1 (2014), 27–56  isi  scopus 33
2009
6. A. G. Dyachkov, A. N. Voronina, “DNA codes for additive stem similarity”, Probl. Peredachi Inf., 45:2 (2009),  56–77  mathnet  mathscinet  zmath; Problems Inform. Transmission, 45:2 (2009), 124–144  isi  scopus 10
2005
7. A. G. D'yachkov, P. A. Vilenkin, I. K. Ismagilov, R. S. Sarbaev, A. Macula, D. Torney, S. White, “On DNA Codes”, Probl. Peredachi Inf., 41:4 (2005),  57–77  mathnet  mathscinet  zmath; Problems Inform. Transmission, 41:4 (2005), 349–367 19
1998
8. P. A. Vilenkin, A. G. D'yachkov, “Asymptotics of the Shannon and Renyi Entropies for Sums of Independent Random Variables”, Probl. Peredachi Inf., 34:3 (1998),  17–31  mathnet  mathscinet  zmath; Problems Inform. Transmission, 32:3 (1998), 219–232 1
1996
9. A. G. D'yachkov, “Asymptotics of the Shannon entropy for sums of independent random variables”, Fundam. Prikl. Mat., 2:4 (1996),  1019–1028  mathnet  mathscinet  zmath 2
1993
10. A. G. D'yachkov, Naser Al' Naser, “On a combinatorial problem in the theory of disjunctive codes”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1993, no. 4,  30–34  mathnet  mathscinet  zmath
1992
11. A. G. D'yachkov, V. M. Sidel'nikov, “Entropy of Some Binary Sources”, Probl. Peredachi Inf., 28:4 (1992),  3–13  mathnet  mathscinet  zmath; Problems Inform. Transmission, 28:4 (1992), 297–307
1988
12. V. V. Rykov, A. G. D'yachkov, “On a Model of Associative Memory”, Probl. Peredachi Inf., 24:3 (1988),  107–110  mathnet  mathscinet  zmath; Problems Inform. Transmission, 24:3 (1988), 257–260
1986
13. A. G. D'yachkov, “Lower Bound on the Ensemble Average Error Probability in a Multiple Access Channel”, Probl. Peredachi Inf., 22:1 (1986),  98–103  mathnet  mathscinet  zmath
1984
14. A. G. D'yachkov, V. V. Rykov, “$B_s$-sequences”, Mat. Zametki, 36:4 (1984),  593–601  mathnet  mathscinet  zmath; Math. Notes, 36:4 (1984), 794–799  isi
1983
15. A. G. D'yachkov, V. V. Rykov, “Improvement of the Code-Length Lower Bound for a Multiple-Access Adder Channel”, Probl. Peredachi Inf., 19:4 (1983),  103–105  mathnet  zmath
1982
16. A. G. D'yachkov, V. V. Rykov, “Bounds on the Length of Disjunctive Codes”, Probl. Peredachi Inf., 18:3 (1982),  7–13  mathnet  mathscinet  zmath; Problems Inform. Transmission, 18:3 (1982), 166–171 33
1981
17. A. G. D'yachkov, “Bounds for Error Probability for a Symmetrical Model in Designing Screening Experiments”, Probl. Peredachi Inf., 17:4 (1981),  41–52  mathnet  mathscinet  zmath; Problems Inform. Transmission, 17:4 (1981), 245–263 2
18. A. G. D'yachkov, V. V. Rykov, “On a Coding Model for a Multiple-Access Adder Channel”, Probl. Peredachi Inf., 17:2 (1981),  26–38  mathnet  mathscinet  zmath; Problems Inform. Transmission, 17:2 (1981), 94–104 4
1980
19. A. G. D'yachkov, “Bounds on the Average Error Probability for a Code Ensemble with Fixed Composition”, Probl. Peredachi Inf., 16:4 (1980),  3–8  mathnet  mathscinet  zmath; Problems Inform. Transmission, 16:4 (1980), 255–259 3
20. A. G. D'yachkov, “Lower Bound for Ensemble-Average Error Probability for a Discrete Memoryless Channel”, Probl. Peredachi Inf., 16:2 (1980),  18–24  mathnet  mathscinet  zmath; Problems Inform. Transmission, 16:2 (1980), 93–98
1979
21. A. G. D'yachkov, “Error Probability Bounds for Two Models of Randomized Design of Screening Experiments”, Probl. Peredachi Inf., 15:4 (1979),  17–31  mathnet  mathscinet  zmath; Problems Inform. Transmission, 15:4 (1979), 258–269 1
22. A. G. D'yachkov, “Bounds on the Error Probability for Certain Ensembles of Random Codes”, Probl. Peredachi Inf., 15:2 (1979),  23–35  mathnet  mathscinet  zmath; Problems Inform. Transmission, 15:2 (1979), 99–108 1
1975
23. A. G. D'yachkov, “Upper Bounds on the Error Probability for Discrete Memoryless Channels with Feedback”, Probl. Peredachi Inf., 11:4 (1975),  13–28  mathnet  mathscinet  zmath; Problems Inform. Transmission, 11:4 (1975), 271–283 2
1972
24. A. G. D'yachkov, “Asymptotic Bounds of the Error Probability for a Gaussian Channel with Feedback and a Peak-Power Constraint on the Input Signal”, Probl. Peredachi Inf., 8:4 (1972),  5–21  mathnet  mathscinet  zmath; Problems Inform. Transmission, 8:4 (1972), 271–284
1971
25. A. G. D'yachkov, “Asymptotic Bounds for Probability of Error for Transmission at Zero Velocity in a Gaussian Channel with Full Feedback”, Probl. Peredachi Inf., 7:3 (1971),  25–29  mathnet  mathscinet  zmath; Problems Inform. Transmission, 7:3 (1971), 211–214
26. A. G. D'yachkov, M. S. Pinsker, “Optimum Linear Transmission through a Memoryless Gaussian Channel with Full Feedback”, Probl. Peredachi Inf., 7:2 (1971),  38–46  mathnet  mathscinet  zmath; Problems Inform. Transmission, 7:2 (1971), 123–129 5
1970
27. A. G. D'yachkov, “Asymptotic Error Probability for Transmission over a Channel with White Gaussian Noise and Instantaneous Noiseless Feedback”, Probl. Peredachi Inf., 6:1 (1970),  33–44  mathnet  zmath; Problems Inform. Transmission, 6:1 (1970), 26–36

2006
28. A. G. D'yachkov, P. A. Vilenkin, I. K. Ismagilov, R. S. Sarbaev, A. Macula, D. Torney, S. White, “Remark on “On DNA Codes” Published in Probl. Peredachi Inf., 2005, no. 4”, Probl. Peredachi Inf., 42:2 (2006),  109  mathnet  mathscinet; Problems Inform. Transmission, 42:2 (2006), 166  scopus

Presentations in Math-Net.Ru
1. DNA sequences and DNA codes
A. G. D'yachkov
Principle Seminar of the Department of Probability Theory, Moscow State University
March 14, 2012 16:45
2. DNA codes for additive stem similarity
A. G. D'yachkov
Principle Seminar of the Department of Probability Theory, Moscow State University
February 25, 2009 16:45
3. Теория кодирования ДНК последовательностей
A. G. D'yachkov
Principle Seminar of the Department of Probability Theory, Moscow State University
November 21, 2007 16:45
4. О некоторых теоретико-информационных и конструктивных результатах в задаче цифровой стеганографии
P. A. Vilenkin, A. G. D'yachkov
Principle Seminar of the Department of Probability Theory, Moscow State University
May 24, 2006

Organisations
 
  Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024