Ryabko Boris Yakovlevich

Publications in Math-Net.Ru

1. Information-theoretic approach to estimating the capacity of distributed memory systems
   
   Probl. Peredachi Inf., 54:2 (2018),  103–111
2. Information-theoretic method for classification of texts
   
   Probl. Peredachi Inf., 53:3 (2017),  100–111
3. Applications of two-faced processes to pseudorandom number generation
   
   Prikl. Diskr. Mat. Suppl., 2016, no. 9,  68–70
4. Time series prediction based on data compression methods
   
   Probl. Peredachi Inf., 52:1 (2016),  101–109
5. The Vernam cipher is robust to small deviations from randomness
   
   Probl. Peredachi Inf., 51:1 (2015),  90–95
6. Fast enumeration algorithm for words with given constraints on run lengths of ones
   
   Probl. Peredachi Inf., 46:4 (2010),  130–139
7. Asymptotically optimal perfect steganographic systems
   
   Probl. Peredachi Inf., 45:2 (2009),  119–126
8. Application of Data Compression Methods to Nonparametric Estimation of Characteristics of Discrete-Time Stochastic Processes
   
   Probl. Peredachi Inf., 43:4 (2007),  109–123
9. A New Type of Attacks on Block Ciphers
   
   Probl. Peredachi Inf., 41:4 (2005),  97–107
10. Experimental Investigation of Forecasting Methods Based on Data Compression Algorithms
    
    Probl. Peredachi Inf., 41:1 (2005),  74–78
11. “Book Stack” as a New Statistical Test for Random Numbers
    
    Probl. Peredachi Inf., 40:1 (2004),  73–78
12. Experimental analysis of pseudorandom number generators by means of a new statistical test
    
    Zh. Vychisl. Mat. Mat. Fiz., 44:5 (2004),  812–816
13. Adaptive $\chi^2$ Criterion for Discrimination of Near Hypotheses with a Large Number of Classes and Its Application to Some Cryptography Problems
    
    Probl. Peredachi Inf., 39:2 (2003),  53–62
14. An estimate for the mean efficiency of search trees constructed for arbitrary sets of binary words
    
    Diskr. Mat., 14:1 (2002),  142–150
15. An Efficient Generation Method for Uniformly Distributed Random Numbers
    
    Probl. Peredachi Inf., 38:1 (2002),  24–30
16. A Simply Realizable Ideal Cryptographic System
    
    Probl. Peredachi Inf., 36:1 (2000),  90–95
17. A fast method for transforming continued fractions into ordinary fractions
    
    Diskr. Mat., 11:4 (1999),  152–156
18. Efficient Method of Adaptive Arithmetic Coding for Sources with Large Alphabets
    
    Probl. Peredachi Inf., 35:4 (1999),  95–108
19. Efficient Conversion of Random Sequences into Equiprobable and Independent Sequences
    
    Probl. Peredachi Inf., 35:2 (1999),  23–28
20. Fast Encoding of Low-Entropy Sources
    
    Probl. Peredachi Inf., 35:1 (1999),  49–61
21. Fast enumeration of combinatorial objects
    
    Diskr. Mat., 10:2 (1998),  101–119
22. A Fast Method for Full Randomization of Messages
    
    Probl. Peredachi Inf., 33:3 (1997),  3–14
23. Data Compression Using an “Imaginary Sliding Window”
    
    Probl. Peredachi Inf., 32:2 (1996),  22–30
24. Using Ideas and Methods of Information Theory in Analyzing the Flexibility of the Language of Ants and Their Aptitude to Add and Subtract Small Numbers
    
    Probl. Peredachi Inf., 31:4 (1995),  100–108
25. Application of Formal Grammars for Encoding Information Sources
    
    Probl. Peredachi Inf., 31:1 (1995),  28–32
26. An Effective Method for Encoding Information Sources Using the Fast Muliplication Algorithm
    
    Probl. Peredachi Inf., 31:1 (1995),  3–12
27. Algorithmic Approach to the Prediction Problem
    
    Probl. Peredachi Inf., 29:2 (1993),  96–103
28. A Universal Search Scheme for a Single Significant Factor in a Disjunctive Model
    
    Probl. Peredachi Inf., 28:4 (1992),  96–102
29. Distortion-free Compression of Telephone Signals in Multichannel Communication Lines
    
    Probl. Peredachi Inf., 27:4 (1991),  105–109
30. Fast Adaptive Coding Algorithm
    
    Probl. Peredachi Inf., 26:4 (1990),  24–37
31. A fast on-line code
    
    Dokl. Akad. Nauk SSSR, 306:3 (1989),  548–552
32. Experimental Proof of the Use of Numerals in the Language of Ants
    
    Probl. Peredachi Inf., 24:4 (1988),  97–101
33. Prediction of Random Sequences and Universal Coding
    
    Probl. Peredachi Inf., 24:2 (1988),  3–14
34. Analysis of the Language of Ants by Information-Theoretical Methods
    
    Probl. Peredachi Inf., 22:3 (1986),  103–108
35. Noiseless Coding of Combinatorial Sources, Hausdorff Dimension, and Kolmogorov Complexity
    
    Probl. Peredachi Inf., 22:3 (1986),  16–26
36. Coding of combinatorial sources and Hausdorff dimension
    
    Dokl. Akad. Nauk SSSR, 277:5 (1984),  1066–1070
37. Twice-Universal Coding
    
    Probl. Peredachi Inf., 20:3 (1984),  24–28
38. Universal coding of compacta
    
    Dokl. Akad. Nauk SSSR, 252:6 (1980),  1325–1328
39. Data Compression by Means of a “Book Stack”
    
    Probl. Peredachi Inf., 16:4 (1980),  16–21
40. Coding of a Source with Unknown but Ordered Probabilities
    
    Probl. Peredachi Inf., 15:2 (1979),  71–77