RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Ryabko, Boris Yakovlevich

Statistics Math-Net.Ru
Total publications: 39
Scientific articles: 39
Presentations: 1

Number of views:
This page:1645
Abstract pages:16625
Full texts:6004
References:671
Professor
Doctor of technical sciences
E-mail: , ,

http://www.mathnet.ru/eng/person27983
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/212692

Publications in Math-Net.Ru
2018
1. B. Ya. Ryabko, “Information-theoretic approach to estimating the capacity of distributed memory systems”, Probl. Peredachi Inf., 54:2 (2018),  103–111  mathnet  elib; Problems Inform. Transmission, 54:2 (2018), 191–198  isi  scopus
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  mathnet  elib; Problems Inform. Transmission, 53:3 (2017), 294–304  isi  scopus
2016
3. B. Ya. Ryabko, “Applications of two-faced processes to pseudorandom number generation”, Prikl. Diskr. Mat. Suppl., 2016, 9,  68–70  mathnet
4. A. S. Lysyak, B. Ya. Ryabko, “Time series prediction based on data compression methods”, Probl. Peredachi Inf., 52:1 (2016),  101–109  mathnet  mathscinet  elib; Problems Inform. Transmission, 52:1 (2016), 92–99  isi  elib  scopus
2015
5. B. Ya. Ryabko, “The Vernam cipher is robust to small deviations from randomness”, Probl. Peredachi Inf., 51:1 (2015),  90–95  mathnet  elib; Problems Inform. Transmission, 51:1 (2015), 82–86  isi  scopus
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  mathnet  mathscinet; Problems Inform. Transmission, 46:4 (2010), 390–399  isi  scopus
2009
7. B. Ya. Ryabko, D. B. Ryabko, “Asymptotically optimal perfect steganographic systems”, Probl. Peredachi Inf., 45:2 (2009),  119–126  mathnet  mathscinet  zmath; Problems Inform. Transmission, 45:2 (2009), 184–190  isi  scopus
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  mathnet  mathscinet  zmath  elib; Problems Inform. Transmission, 43:4 (2007), 367–379  isi  elib  scopus
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  mathnet  mathscinet  zmath; Problems Inform. Transmission, 41:4 (2005), 385–394
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  mathnet  zmath  elib; Problems Inform. Transmission, 41:1 (2005), 65–69
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  mathnet  mathscinet  zmath; Problems Inform. Transmission, 40:1 (2004), 66–71
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  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 44:5 (2004), 766–770
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  mathnet  mathscinet  zmath; Problems Inform. Transmission, 39:2 (2003), 207–215
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  mathnet  mathscinet  zmath; 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  mathnet  mathscinet  zmath; 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  mathnet  mathscinet  zmath; Problems Inform. Transmission, 36:1 (2000), 84–89
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  mathnet  mathscinet  zmath; 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  mathnet  mathscinet  zmath; Problems Inform. Transmission, 35:4 (1999), 369–380
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  mathnet  mathscinet  zmath; Problems Inform. Transmission, 35:2 (1999), 112–116
20. B. Ya. Ryabko, M. P. Sharova, “Fast Encoding of Low-Entropy Sources”, Probl. Peredachi Inf., 35:1 (1999),  49–61  mathnet  mathscinet  zmath; Problems Inform. Transmission, 35:1 (1999), 42–51
1998
21. B. Ya. Ryabko, “Fast enumeration of combinatorial objects”, Diskr. Mat., 10:2 (1998),  101–119  mathnet  mathscinet  zmath; Discrete Math. Appl., 8:2 (1998), 163–182
1997
22. B. Ya. Ryabko, A. N. Fionov, “A Fast Method for Full Randomization of Messages”, Probl. Peredachi Inf., 33:3 (1997),  3–14  mathnet  mathscinet  zmath; 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  mathnet  mathscinet  zmath; Problems Inform. Transmission, 32:2 (1996), 156–163
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  mathnet  zmath; Problems Inform. Transmission, 31:4 (1995), 380–387
25. E. V. Kurapova, B. Ya. Ryabko, “Application of Formal Grammars for Encoding Information Sources”, Probl. Peredachi Inf., 31:1 (1995),  28–32  mathnet  zmath; 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  mathnet  mathscinet  zmath; Problems Inform. Transmission, 31:1 (1995), 1–9
1993
27. B. Ya. Ryabko, “Algorithmic Approach to the Prediction Problem”, Probl. Peredachi Inf., 29:2 (1993),  96–103  mathnet  mathscinet  zmath; 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  mathnet  zmath; 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  mathnet  zmath; 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  mathnet  mathscinet  zmath; Problems Inform. Transmission, 26:4 (1990), 305–317
1988
31. 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  mathnet  mathscinet; Problems Inform. Transmission, 24:4 (1988), 334–338
32. B. Ya. Ryabko, “Prediction of Random Sequences and Universal Coding”, Probl. Peredachi Inf., 24:2 (1988),  3–14  mathnet  mathscinet  zmath; Problems Inform. Transmission, 24:2 (1988), 87–96
1986
33. Zh. I. Reznikova, B. Ya. Ryabko, “Analysis of the Language of Ants by Information-Theoretical Methods”, Probl. Peredachi Inf., 22:3 (1986),  103–108  mathnet  zmath; Problems Inform. Transmission, 22:3 (1986), 245–249
34. B. Ya. Ryabko, “Noiseless Coding of Combinatorial Sources, Hausdorff Dimension, and Kolmogorov Complexity”, Probl. Peredachi Inf., 22:3 (1986),  16–26  mathnet  mathscinet  zmath; Problems Inform. Transmission, 22:3 (1986), 170–179
1984
35. B. Ya. Ryabko, “Coding of combinatorial sources and Hausdorff dimension”, Dokl. Akad. Nauk SSSR, 277:5 (1984),  1066–1070  mathnet  mathscinet  zmath
36. B. Ya. Ryabko, “Twice-Universal Coding”, Probl. Peredachi Inf., 20:3 (1984),  24–28  mathnet  mathscinet  zmath; Problems Inform. Transmission, 20:3 (1984), 173–177
1980
37. B. Ya. Ryabko, “Universal coding of compacta”, Dokl. Akad. Nauk SSSR, 252:6 (1980),  1325–1328  mathnet  mathscinet  zmath
38. B. Ya. Ryabko, “Data Compression by Means of a “Book Stack””, Probl. Peredachi Inf., 16:4 (1980),  16–21  mathnet  mathscinet  zmath; Problems Inform. Transmission, 16:4 (1980), 265–269
1979
39. B. Ya. Ryabko, “Coding of a Source with Unknown but Ordered Probabilities”, Probl. Peredachi Inf., 15:2 (1979),  71–77  mathnet  mathscinet  zmath; Problems Inform. Transmission, 15:2 (1979), 134–138

Presentations in Math-Net.Ru
1. Применение методов универсального кодирования для непараметрического оценивания вероятностей, плотностей и проверки статистических гипотез о случайных процессах с дискретным временем
B. Ya. Ryabko
Principle Seminar of the Department of Probability Theory, Moscow State University
February 20, 2008 16:45

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020