D'yachkov Arkadii Georgievich

Publications in Math-Net.Ru

1. 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
2. Erratum to: “Bounds on the rate of disjunctive codes” [Problems of Information Transmission 50, 27 (2014)]
   
   Probl. Peredachi Inf., 52:2 (2016),  111
3. Almost disjunctive list-decoding codes
   
   Probl. Peredachi Inf., 51:2 (2015),  27–49
4. DNA codes for nonadditive stem similarity
   
   Probl. Peredachi Inf., 50:3 (2014),  51–75
5. Bounds on the rate of disjunctive codes
   
   Probl. Peredachi Inf., 50:1 (2014),  31–63
6. DNA codes for additive stem similarity
   
   Probl. Peredachi Inf., 45:2 (2009),  56–77
7. On DNA Codes
   
   Probl. Peredachi Inf., 41:4 (2005),  57–77
8. Asymptotics of the Shannon and Renyi Entropies for Sums of Independent Random Variables
   
   Probl. Peredachi Inf., 34:3 (1998),  17–31
9. Asymptotics of the Shannon entropy for sums of independent random variables
   
   Fundam. Prikl. Mat., 2:4 (1996),  1019–1028
10. On a combinatorial problem in the theory of disjunctive codes
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1993, no. 4,  30–34
11. Entropy of Some Binary Sources
    
    Probl. Peredachi Inf., 28:4 (1992),  3–13
12. On a Model of Associative Memory
    
    Probl. Peredachi Inf., 24:3 (1988),  107–110
13. Lower Bound on the Ensemble Average Error Probability in a Multiple Access Channel
    
    Probl. Peredachi Inf., 22:1 (1986),  98–103
14. $B_s$-sequences
    
    Mat. Zametki, 36:4 (1984),  593–601
15. Improvement of the Code-Length Lower Bound for a Multiple-Access Adder Channel
    
    Probl. Peredachi Inf., 19:4 (1983),  103–105
16. Bounds on the Length of Disjunctive Codes
    
    Probl. Peredachi Inf., 18:3 (1982),  7–13
17. Bounds for Error Probability for a Symmetrical Model in Designing Screening Experiments
    
    Probl. Peredachi Inf., 17:4 (1981),  41–52
18. On a Coding Model for a Multiple-Access Adder Channel
    
    Probl. Peredachi Inf., 17:2 (1981),  26–38
19. Bounds on the Average Error Probability for a Code Ensemble with Fixed Composition
    
    Probl. Peredachi Inf., 16:4 (1980),  3–8
20. Lower Bound for Ensemble-Average Error Probability for a Discrete Memoryless Channel
    
    Probl. Peredachi Inf., 16:2 (1980),  18–24
21. Error Probability Bounds for Two Models of Randomized Design of Screening Experiments
    
    Probl. Peredachi Inf., 15:4 (1979),  17–31
22. Bounds on the Error Probability for Certain Ensembles of Random Codes
    
    Probl. Peredachi Inf., 15:2 (1979),  23–35
23. Upper Bounds on the Error Probability for Discrete Memoryless Channels with Feedback
    
    Probl. Peredachi Inf., 11:4 (1975),  13–28
24. 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
25. 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
26. Optimum Linear Transmission through a Memoryless Gaussian Channel with Full Feedback
    
    Probl. Peredachi Inf., 7:2 (1971),  38–46
27. Asymptotic Error Probability for Transmission over a Channel with White Gaussian Noise and Instantaneous Noiseless Feedback
    
    Probl. Peredachi Inf., 6:1 (1970),  33–44


28. Remark on “On DNA Codes” Published in Probl. Peredachi Inf., 2005, no. 4
    
    Probl. Peredachi Inf., 42:2 (2006),  109