|
|
Publications in Math-Net.Ru |
Citations |
|
2018 |
1. |
B. Ya. Ryabko, “Information-theoretic approach to estimating the capacity of distributed memory systems”, Probl. Peredachi Inf., 54:2 (2018), 103–111 ; Problems Inform. Transmission, 54:2 (2018), 191–198 |
|
2017 |
2. |
B. Ya. Ryabko, A. E. Gus'kov, I. V. Selivanova, “Information-theoretic method for classification of texts”, Probl. Peredachi Inf., 53:3 (2017), 100–111 ; Problems Inform. Transmission, 53:3 (2017), 294–304 |
7
|
|
2016 |
3. |
B. Ya. Ryabko, “Applications of two-faced processes to pseudorandom number generation”, Prikl. Diskr. Mat. Suppl., 2016, no. 9, 68–70 |
4. |
A. S. Lysyak, B. Ya. Ryabko, “Time series prediction based on data compression methods”, Probl. Peredachi Inf., 52:1 (2016), 101–109 ; Problems Inform. Transmission, 52:1 (2016), 92–99 |
8
|
|
2015 |
5. |
B. Ya. Ryabko, “The Vernam cipher is robust to small deviations from randomness”, Probl. Peredachi Inf., 51:1 (2015), 90–95 ; Problems Inform. Transmission, 51:1 (2015), 82–86 |
7
|
|
2010 |
6. |
Yu. S. Medvedeva, B. Ya. Ryabko, “Fast enumeration algorithm for words with given constraints on run lengths of ones”, Probl. Peredachi Inf., 46:4 (2010), 130–139 ; Problems Inform. Transmission, 46:4 (2010), 390–399 |
4
|
|
2009 |
7. |
B. Ya. Ryabko, D. B. Ryabko, “Asymptotically optimal perfect steganographic systems”, Probl. Peredachi Inf., 45:2 (2009), 119–126 ; Problems Inform. Transmission, 45:2 (2009), 184–190 |
24
|
|
2007 |
8. |
B. Ya. Ryabko, “Application of Data Compression Methods to Nonparametric Estimation
of Characteristics of Discrete-Time Stochastic Processes”, Probl. Peredachi Inf., 43:4 (2007), 109–123 ; Problems Inform. Transmission, 43:4 (2007), 367–379 |
|
2005 |
9. |
B. Ya. Ryabko, V. A. Monarev, Yu. I. Shokin, “A New Type of Attacks on Block Ciphers”, Probl. Peredachi Inf., 41:4 (2005), 97–107 ; Problems Inform. Transmission, 41:4 (2005), 385–394 |
8
|
10. |
B. Ya. Ryabko, V. A. Monarev, “Experimental Investigation of Forecasting Methods
Based on Data Compression Algorithms”, Probl. Peredachi Inf., 41:1 (2005), 74–78 ; Problems Inform. Transmission, 41:1 (2005), 65–69 |
10
|
|
2004 |
11. |
B. Ya. Ryabko, A. I. Pestunov, ““Book Stack” as a New Statistical Test for Random Numbers”, Probl. Peredachi Inf., 40:1 (2004), 73–78 ; Problems Inform. Transmission, 40:1 (2004), 66–71 |
20
|
12. |
V. A. Monarev, B. Ya. Ryabko, “Experimental analysis of pseudorandom number generators by means of a new statistical test”, Zh. Vychisl. Mat. Mat. Fiz., 44:5 (2004), 812–816 ; Comput. Math. Math. Phys., 44:5 (2004), 766–770 |
3
|
|
2003 |
13. |
B. Ya. Ryabko, V. S. Stognienko, Yu. I. Shokin, “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 ; Problems Inform. Transmission, 39:2 (2003), 207–215 |
3
|
|
2002 |
14. |
B. Ya. Ryabko, A. A. Fedotov, “An estimate for the mean efficiency of search trees constructed for arbitrary sets of binary words”, Diskr. Mat., 14:1 (2002), 142–150 ; Discrete Math. Appl., 12:2 (2002), 155–163 |
15. |
B. Ya. Ryabko, E. P. Machikina, “An Efficient Generation Method for Uniformly Distributed Random Numbers”, Probl. Peredachi Inf., 38:1 (2002), 24–30 ; Problems Inform. Transmission, 38:1 (2002), 20–25 |
|
2000 |
16. |
B. Ya. Ryabko, “A Simply Realizable Ideal Cryptographic System”, Probl. Peredachi Inf., 36:1 (2000), 90–95 ; Problems Inform. Transmission, 36:1 (2000), 84–89 |
1
|
|
1999 |
17. |
E. P. Machikina, B. Ya. Ryabko, “A fast method for transforming continued fractions into ordinary fractions”, Diskr. Mat., 11:4 (1999), 152–156 ; Discrete Math. Appl., 9:5 (1999), 497–501 |
18. |
B. Ya. Ryabko, A. N. Fionov, “Efficient Method of Adaptive Arithmetic Coding for Sources with Large Alphabets”, Probl. Peredachi Inf., 35:4 (1999), 95–108 ; Problems Inform. Transmission, 35:4 (1999), 369–380 |
6
|
19. |
B. Ya. Ryabko, E. P. Machikina, “Efficient Conversion of Random Sequences into Equiprobable and Independent Sequences”, Probl. Peredachi Inf., 35:2 (1999), 23–28 ; Problems Inform. Transmission, 35:2 (1999), 112–116 |
1
|
20. |
B. Ya. Ryabko, M. P. Sharova, “Fast Encoding of Low-Entropy Sources”, Probl. Peredachi Inf., 35:1 (1999), 49–61 ; Problems Inform. Transmission, 35:1 (1999), 42–51 |
1
|
|
1998 |
21. |
B. Ya. Ryabko, “Fast enumeration of combinatorial objects”, Diskr. Mat., 10:2 (1998), 101–119 ; Discrete Math. Appl., 8:2 (1998), 163–182 |
15
|
|
1997 |
22. |
B. Ya. Ryabko, A. N. Fionov, “A Fast Method for Full Randomization of Messages”, Probl. Peredachi Inf., 33:3 (1997), 3–14 ; Problems Inform. Transmission, 33:3 (1997), 191–201 |
|
1996 |
23. |
B. Ya. Ryabko, “Data Compression Using an “Imaginary Sliding Window””, Probl. Peredachi Inf., 32:2 (1996), 22–30 ; Problems Inform. Transmission, 32:2 (1996), 156–163 |
4
|
|
1995 |
24. |
Zh. I. Reznikova, B. Ya. Ryabko, “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 ; Problems Inform. Transmission, 31:4 (1995), 380–387 |
1
|
25. |
E. V. Kurapova, B. Ya. Ryabko, “Application of Formal Grammars for Encoding Information Sources”, Probl. Peredachi Inf., 31:1 (1995), 28–32 ; Problems Inform. Transmission, 31:1 (1995), 23–26 |
26. |
B. Ya. Ryabko, “An Effective Method for Encoding Information Sources Using the Fast Muliplication Algorithm”, Probl. Peredachi Inf., 31:1 (1995), 3–12 ; Problems Inform. Transmission, 31:1 (1995), 1–9 |
2
|
|
1993 |
27. |
B. Ya. Ryabko, “Algorithmic Approach to the Prediction Problem”, Probl. Peredachi Inf., 29:2 (1993), 96–103 ; Problems Inform. Transmission, 29:2 (1993), 186–193 |
|
1992 |
28. |
B. Ya. Ryabko, “A Universal Search Scheme for a Single Significant Factor in a Disjunctive Model”, Probl. Peredachi Inf., 28:4 (1992), 96–102 ; Problems Inform. Transmission, 28:4 (1992), 384–389 |
|
1991 |
29. |
V. R. Zvonkovich, I. V. Pertsev, B. Ya. Ryabko, I. V. Sitnyakovskii, “Distortion-free Compression of Telephone Signals in Multichannel Communication Lines”, Probl. Peredachi Inf., 27:4 (1991), 105–109 ; Problems Inform. Transmission, 27:4 (1991), 366–369 |
|
1990 |
30. |
B. Ya. Ryabko, “Fast Adaptive Coding Algorithm”, Probl. Peredachi Inf., 26:4 (1990), 24–37 ; Problems Inform. Transmission, 26:4 (1990), 305–317 |
4
|
|
1989 |
31. |
B. Ya. Ryabko, “A fast on-line code”, Dokl. Akad. Nauk SSSR, 306:3 (1989), 548–552 ; Dokl. Math., 39:3 (1989), 533–537 |
|
1988 |
32. |
Zh. I. Reznikova, B. Ya. Ryabko, “Experimental Proof of the Use of Numerals in the Language of Ants”, Probl. Peredachi Inf., 24:4 (1988), 97–101 ; Problems Inform. Transmission, 24:4 (1988), 334–338 |
1
|
33. |
B. Ya. Ryabko, “Prediction of Random Sequences and Universal Coding”, Probl. Peredachi Inf., 24:2 (1988), 3–14 ; Problems Inform. Transmission, 24:2 (1988), 87–96 |
8
|
|
1986 |
34. |
Zh. I. Reznikova, B. Ya. Ryabko, “Analysis of the Language of Ants by Information-Theoretical Methods”, Probl. Peredachi Inf., 22:3 (1986), 103–108 ; Problems Inform. Transmission, 22:3 (1986), 245–249 |
1
|
35. |
B. Ya. Ryabko, “Noiseless Coding of Combinatorial Sources, Hausdorff Dimension, and Kolmogorov Complexity”, Probl. Peredachi Inf., 22:3 (1986), 16–26 ; Problems Inform. Transmission, 22:3 (1986), 170–179 |
|
1984 |
36. |
B. Ya. Ryabko, “Coding of combinatorial sources and Hausdorff dimension”, Dokl. Akad. Nauk SSSR, 277:5 (1984), 1066–1070 |
37. |
B. Ya. Ryabko, “Twice-Universal Coding”, Probl. Peredachi Inf., 20:3 (1984), 24–28 ; Problems Inform. Transmission, 20:3 (1984), 173–177 |
7
|
|
1980 |
38. |
B. Ya. Ryabko, “Universal coding of compacta”, Dokl. Akad. Nauk SSSR, 252:6 (1980), 1325–1328 |
39. |
B. Ya. Ryabko, “Data Compression by Means of a “Book Stack””, Probl. Peredachi Inf., 16:4 (1980), 16–21 ; Problems Inform. Transmission, 16:4 (1980), 265–269 |
7
|
|
1979 |
40. |
B. Ya. Ryabko, “Coding of a Source with Unknown but Ordered Probabilities”, Probl. Peredachi Inf., 15:2 (1979), 71–77 ; Problems Inform. Transmission, 15:2 (1979), 134–138 |
3
|
|
Presentations in Math-Net.Ru |
|
|
Organisations |
|
|
|
|