Papers
Scientific Biography
C.V.
Grants, awards and visits
The calculator
"Group Your Alphabet"
First page



Publications          Reports



Selected Publications

62. B. Ryabko, D. Ryabko. Information--Theoretic Approach to Steganographic Systems.
  IEEE International Symposium on Information Theory, Proceedings. 2007, Nice, France, pp. 2461-2464.
  download text.

61. Boris Ryabko, Jaakko Astola and Alex Gammerman.
  Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series.
  Theoretical Computer Science, v.359, pp.440-448, 2006.
  download text.

60. Boris Ryabko and Jaakko Astola. "Universal Codes as a Basis for Time Series Testing "
  "Statistical Methodology" v.3, pp.375-397 ,2006,
  download text.

59. B.Ryabko, V.Monarev, Yu.Shokin. A New Type of Attacks on Block Ciphers.
  Problems of Information Transmission, 2005, v.41, n.4, pp. 385-394. (in Russian: pp. 118-128.)
  download text in English. download text in Russian.

58. B.Ryabko, A. Fionov. Basics of Contemporary Cryptography for IT Practitioners. World Scientific Publishing Co., 2005.
  available here
  http://www.amazon.com/gp/product/9812564055/ref=nosim/103-6068356-7637446?n=283155

57. B.Ryabko, V.Monarev.
  Experimental Investigation of Forecasting Methods Based on Data Compression Algorithms.
  Problems of Information Transmission, 2005, v.41, n.1, pp. 65-69. (in Russian: pp. 74-78.)
  download text in English. download text in Russian.

56. Boris Ryabko and Jaakko Astola. "Universal codes as a basis for nonparametric testing of serial independence for time series"
  Journal of Statistical Planning and Inference,2006, Volume 136, Issue 12, pp. 4119-4128
  download text.

55. B. Ya. Ryabko, V.A. Monarev. Using information theory approach to randomness testing.
  Journal of Statistical Planning and Inference,2005, v. 133, n.1, pp. 95-110.
  download text.

54. Boris Ryabko and Jaakko Astola. Application of data compression methods to hypothesis testing for ergodic and stationary processes.
  Discrete Mathematics & Theoretical Computer Science.
  (2005 International Conference on Analysis of Algorithms Conference Volume AD (2005)), pp. 399-408. http://www.dmtcs.org/proceedings/abstracts/dmAD0138.abs.html

53. B. Ya. Ryabko, V. S. Stognienko, Yu. I. Shokin.
  A new test for randomness and its application to some cryptographic problems.
  Journal of Statistical Planning and Inference, 2004, v. 123, n. 2 pp. 365-376. download text.

52. B.Ryabko, A.Pestunov. "Book Stack" as a New Statistical Test for Random Numbers.
Problems of Information Transmission, 2004, v.40, n.1, pp. 66-71. (in Russian: pp. 73-78.)

51. J. Suzuki, B.Ryabko. Coding Combinatorial Sources With Costs.
  IEEE Trans. Inform. Theory, v.50, 2004, no. 5, 925-928.

50. B.Ryabko, A. Fionov. The basis of the modern cryptography for IT practitioners. 2004, "Scientific Word", Moscow. (in Russian). 173 p.

49.Boris Ryabko, Jaakko Astola.
Universal Coding of Function Spaces as a Model for Signal Compression.
  Proceedings of Data Compression Conference (DCC '04), 2004, Snowbird, Utah. pp. 382-387. download text.

48. Zh. Reznikova, B. Ryabko. In the Shadow of the Binary Tree: Ants and Bits.
2-nd Internat. Workshop on the Mathematics and Algorithms of Social Insects. Atlanta, USA, 2003, pp 139- 144.
(see also http://www.insects.gatech.edu/ )

47. Boris Ryabko, Jaakko Astola, Karen Egiazarian. Fast Codes for Large Alphabets.
  Communications in Information and Systems, v.3, n. 2, pp.139-152. download text.

46. Boris Ryabko, Jorma Rissanen. Fast Adaptive Arithmetic Code for Large Alphabet Sources with Asymmetrical Distributions.
  IEEE Communications Letters,v. 7, no. 1, 2003,pp.33- 35.

45. Boris Ya. Ryabko, Flemming Topsoe. On Asymptotically Optimal Methods of Prediction and Adaptive Coding for Markov Sources.
  Journal of Complexity, Vol. 18, No. 1, Mar 2002, pp. 224-241 (doi: 10.1006/jcom.2001.0611).
  download text in PS format

44.Fedotov, A. Ryabko, B. The estimated cost of a search tree on binary words.
  IEEE Trans. Inform. Theory 47 (2001), no. 1, 326--329. download text

43.B. Ryabko. The nonprobabilistic approach to learning the best prediction.
 in: Linkoping Electronic Articles in Computer and Information Science, ISSN 1401-9841 Issue: Vol. 6(2001): nr 016
  URL: http://www.ep.liu.se/ea/cis/2001/016/
 

42.Zh. Reznikova and B. Ryabko. How to study ants. Numerical competence using their own communicative means and applying ideas of information theory.
  Linkoping Electronic Articles in Computer and Information Science, ISSN 1401-9841 Issue: Vol. 6(2001): nr 015
  URL: http://www.ep.liu.se/ea/cis/2001/015/ download text.

41. Hojo K. , Ryabko B., Suzuki J. Performance of Data Compression in Terms of Hausdorff Dimension.
  TIEICE: IEICE Transactions on Communications/Electronics/ Information and Systems, 2001, pp.1761--1764. download text in PS format

40. Ryabko, B.Y.; Matchikina, E.Fast and efficient construction of an unbiased random sequence.
  IEEE Transactions on Information Theory, V.46,n.3,2000 p.1090 -1093. download text.

39. Ryabko, B. Ya. A simply realizable ideal cryptographic system.
  Problems of Information Transmission, 36 (2000), no. 1,pp. 90--95.
  (see also
 Boris Ryabko.The simple ideal cipher system.
  In: cryptology ePrint archive, report 2001/046. download text in PS format

38. Reznikova Zh.I., Ryabko B.Ya. 2000. Using Information Theory Approach
  to study the communication system and numerical competence in ants.
  In : From Animals to Animats 6. Proceeding of the Sixth International Conference on Simulation of Adaptive Behaviour.
  The MIT Press, Cambridge, Massachusetts, London. pp. 501 - 506.

37. Ryabko, B. Ya.; Sharova, M. P. Fast coding of low-entropy sources.
  IEEE Transactions on Information Theory, V. 45,# 7 , Nov. 1999, pp. 2612 -2615. download text.

36. B.Ryabko, J. Suzuki, F. Topsoe, Hausdorff Dimension as a New Dimension in Source Coding and Predicting
  //1999 IEEE Information Theory Workshop, South Africa, 1999,pp.66-68. download text.

35.Reznikova Zh.I., Ryabko B.Ya. 1999. Experimental study of ant capability
  for addition and subtraction of small numbers.
  Journal of High Nervous Activity, 49, 1, pp. 12-21.

34. Ryabko, B. Fionov,A. Efficient homophonic coding.
  IEEE Trans. Inform. Theory 45 (1999), no. 6, 2083--2091. download text.

33. Ryabko, B. Ya.; Fionov, A. N. An efficient method for adaptive arithmetic coding of sources with large alphabets.
  Prpblems of Information Transmission,v. 35 (1999), no. 4, 95--108. download text in PS format (in Russian)

32. Ryabko,B.Fionov,A. Fast and Space-Efficient Adaptive Arithmetic Coding.
  in :Cryptography and Coding, 7th IMA International Conference,
  Cirencester, UK, December 1999. Proceedings, LNCS 1746, p. 270 -279. download text in PS format

31. Machikina, E. P.; Ryabko, B. Ya. A fast method for transforming continued
  fractions into ordinary fractions. (Russian) Diskret. Mat. 11 (1999), no. 4,152--156;
  translation in Discrete Math. Appl. 9 (1999), no. 5, 497--501

30.Ryabko B.Ya. The fast enumeration of combinatorial objects.
 //Discrete Math.and Applications, v.10, n2, 1998.
  (see also http://arxiv.org/abs/cs.CC/0601069 ).

29.Ryabko B.,Fionov A. Homophonic coding with logarithmic memory size.//
 Algorithms and Computation.Lecture Notes in Computer Science,v.1350,
 Springer-Verlag,1997,pp.253-262.

28. Reznikova Zh.I., Ryabko B.Ya. 1997. Numerical Competence in Ants. Science in Russia , 4 , pp. 31 - 34.

27. Ryabko B. Ya., Reznikova Zh.I. 1997. Ants aptitude to add and subtract small numbers.
  In : Russian Science, Moscow, "Nauka", pp. 351 - 357. In Russian.
  ( a book of winners of competition for a premium for best publication from ISF ).

26.Ryabko B., Fionov A. The fast method of randomization.// Problems of
 information transmission,1997, v.33, #3.

25.Ryabko B.,Reznikova Zh. Using Shannon Entropy and Kolmogorov Complexity
 To Study the Communicative System and Cognitive Capacities in Ants.//
 Complexity, v.2,n.2,pp.37-42, 1996.

24.Reznikova Zh.I., Ryabko B.Ya. 1995. Using of ideas and metods of
  Information Theory to study the flexibility of ant's language and their aptitude to add and substrate small numbers.
  Problems of Information Transmission, 31, 4, pp. 25 - 30.

23.Ryabko B. Ya., Fionov A. N. A Fast and Efficient Homophonic
 Coding Algorithm.//Algorithm and Computation,Lecture notes in computer
 science,v.1178,Springer-Verlag, Berlin, Germany.,1996.pp. 427-435.
 

22.Ryabko B.Ya. " Imaginary sliding window" as a tool for data
  compession.// Problems of information transmission,1996,v.32,#2. download text in PS format

21.Ryabko B.Ya. The effective method of source coding which uses the fast
  multiplication.// Problems of information transmission,1995,v.31,#1.
  pp.3-12.

20.Kurapova E., Ryabko B.Ya. Using formal grammars for source coding.
  //Problems of information transmission,1995,v.31,#1.,pp.28-32.

19. Ryabko, Boris Ya. The complexity and effectiveness of prediction algorithms.
  J. Complexity 10 (1994), no. 3, 281--295. download text.

18. Ryabko B.Ya. Fast and effective source coding.
  IEEE Trans.on Inform.Theory,v.30,n 1,pp.96-99,1994.

17. Reznikova,Zh., Ryabko,B. 1994. Experimental study of the ants communication
  system with the application of the Information Theory approach.
  Memorabilia Zoologica,v.48, 219-236.

16. Reznikova, Zh.I., Ryabko,B.Ya.1994. An experimental study of ants' language
  and cognitive aptitude based on ideas of the Information Theory.
  Siberian Journal of Ecology, 4, pp. 347-359.

15. Ryabko, B. Ya. An algorithmic approach to the prediction problem. (Russian) Problemy Peredachi Informatsii 29 (1993), no. 2,96--103;
  translation in Problems Inform. Transmission 29 (1993), no. 2, 186--193

14. B.Ya Ryabko; A fast on-line adaptive code.
  IEEE Trans.on Inform.Theory,v.28,n 1, Jul 1992 pp. 1400 - 1404.

13. Ryabko, B. Ya. A fast adaptive coding algorithm. (Russian) Problemy Peredachi Informatsii 26 (1990), no. 4,24--37;
  translation in Problems Inform. Transmission 26 (1990), no. 4, 305--317 (1991)

12. Ryabko, B. Ya. A fast on-line code. (Russian) Dokl. Akad. Nauk SSSR 306 (1989) , no. 3,548--552;
  translation in Soviet Math. Dokl. 39 (1989), no. 3, 533--537

11. Ryabko, B. Ya. Prediction of random sequences and universal coding.
  (Russian) Problemy Peredachi Informatsii 24 (1988), no. 2,3--14;
  translation in Problems Inform. Transmission 24 (1988), no. 2, 87--96 download text in PDF format (1.3M) better quality copy (4M) available upon request.

10. Reznikova, Zh. I.; Ryabko, B. Ya. An experimental proof of the use of numerals in the language of ants.
  (Russian) Problemy Peredachi Informatsii 24 (1988), no. 4,97--101;
  translation in Problems Inform. Transmission 24 (1988), no. 4, 334--338 (1989)

9. Ryabko, B. Ya. Noise-free coding of combinatorial sources, Hausdorff dimension and Kolmogorov complexity.
  Problemy Peredachi Informatsii 22 (1986), no. 3, 16--26.

8. Ryabko, B. Ya.; Horspool, R. Nigel; Cormack, Gordon V. Comments to:
  "A locally adaptive data compression scheme" by J. L. Bentley, D. D. Sleator, R. E. Tarjan and V. K. Wei.
  Comm. ACM 30 (1987), no. 9, 792--794.

7. Krichevsky, R. E.; Ryabko, B. Ya. Universal retrieval trees.
  Discrete Appl. Math. 12 (1985), no. 3, 293--302.

6. Ryabko B.Ya.Twice-universal coding.Problems of Information Transmission.1984,n3, pp.173-177. download text in PDF format.

5. Krichevski R. E.; Ryabko, B. Ya.; Haritonov, A. Yu.
  Optimal key for taxons ordered in accordance with their frequencies.
  Discrete Appl. Math. 3 (1981), no. 1, 67--72.

4. Ryabko, Boris Ya. Comments on: "A source matching approach to finding minimax codes",
  IEEE Trans. Inform. Theory 27 (1981), no. 6, 780--781.

3.Ryabko, B. Ya. Data compression by means of a "book stack". Problems Inform. Transmission 16 (1980), no. 4, 265--269 (1981)

2.Rjabko, B. Ja. A universal encoding of compacta. Dokl. Akad. Nauk SSSR 252 (1980), no. 6, 1325--1328.

1.Ryabko, B. Ya. Coding of a source with unknown but ordered probabilities.
  Problems Inform. Transmission 15 (1979), no. 2, 134--138; download text in PDF format.


Selected Reports

B.Ryabko. Compression-based methods for density estimation for time series.
XI International Symposium on Problems of Redundancy in Information and Control Systems, Saint-Petersburg, 2007, Proceedings, pp.22-26. download text.

M. Zhilkin, N. Melentsova, B. Ryabko. Data Compression Based Method Of Revealing Hidden Information In Steganographic Systems.
XI International Symposium on Problems of Redundancy in Information and Control Systems, Saint-Petersburg, 2007, Proceedings, pp. 42-44.

N. Usotskaya, B. Ryabko. Experimental research of the genome structure using theoretic-informational statistical tests.
XI International Symposium on Problems of Redundancy in Information and Control Systems, Saint-Petersburg, 2007, Proceedings, pp.37-41.

A.Fionov, B.Ryabko. Simple ideal steganografic systems for containers with known statistics.
XI International Symposium on Problems of Redundancy in Information and Control Systems, Saint-Petersburg, 2007, Proceedings, pp. 184-188.

Ryabko, Boris. Universal codes as a basis for time series testing.
In: Conference Proceedings, Prague Stochastics 2006 pp.236- 246.

B.Ryabko. Universal Codes as a Basis for Time Series Testing.
Dagstuhl Seminar Proceedings 06201, (15.05.-20.05.06)
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery.

B.Ryabko, J.Astola, A.Gammerman
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series.
Dagstuhl Seminar Proceedings 06051. Kolmogorov Complexity and Applications.

B.Ryabko, J.Astola.
Universal Codes as a Basis for Nonparametric Testing of Serial Independence for Time Series
International Symposium on Information Theory, Proceedings. IEEE , 2005, Adelaide, Australia.

B.Ryabko, J.Astola.
Application of source coding to hypothesis testing for ergodic and stationary processes. Proceedings, European Meeting of Statisticians, Oslo 24-28, July 2005.

Boris Ryabko, Viktor Monarev, and Yuriy Shokin.
Using Universal Coding Approach to Randomness Testing.
International Symposium on Information Theory, Proceedings. IEEE , 2004, Chicago,

Boris Ryabko and Jaakko Astola.
Prediction and Adaptive Coding of Sources with Large or Infinite Alphabet.
International Symposium on Information Theory, Proceedings. IEEE , 2004, Chicago

Boris Ryabko, Jaakko Astola.
Adaptive Coding and Prediction of Sources with Large and Infinite Alphabets.
Proceedings of Data Compression Conference (DCC '04) 2004, Snowbird, Utah. p 560. download text.

Boris Ryabko, Jaakko Astola.
Fast Codes for Large Alphabet Sources and Its Application to Block Encoding.
Proceedings of Data Compression Conference (DCC '04) 2004, Snowbird, Utah. p 561. download text.

Zh. Reznikova, B. Ryabko 2003. Sophisticated Communication in Group- Retrieving Ants: a New Tool to Find News.
Revusta de Etologia Suplemento, Contribution to the XXVIII Internat. Ethological Conference, Brazil, p. 69-69.

B.Ya. Ryabko, V.S. Stognienko, and Yu.I. Shokin A new statistical testing for random numbers and its application to some cryptographic problems.
International Symposium on Information Theory,Proceedings.IEEE , 2003, Yokohama, Japan, p.338.
download text in pdf format

Boris Ryabko, Jaakko Astola. Fast Codes for Large Alphabet Sources and Its Application to Block Encoding.
International Symposium on Information Theory,Proceedings.IEEE , 2003, Yokohama, Japan, p.112.
download text in pdf format

Joe Suzuki, Boris Ryabko, . Coding Combinatorial Sources with Cost.
International Symposium on Information Theory,Proceedings.IEEE , 2003, Yokohama, Japan, p.113.

B. Ryabko . Universal Prediction, Universal Source Coding and Kolmogorov Complexity.
Centennial Seminar on Kolmogorov Complexity and Applications. SCHLOSS DAGSTUHL 27.04.-02.05.2003, Germany. (Proceedings).
See also http://www.dagstuhl.de/03181/Proceedings/

Ryabko, B.; Mrchokov, G.; Egiazarian, K.; Astola, J.;
The fast algorithm for the block codes and its application to image compression.
2003 International Conference on Image Processing, 2003. Proceedings., Volume: 2 , Sept. 14-17, 2003 Page(s): 205 -207.

Boris Ryabko, Jorma Rissanen . Fast Adaptive Arithmetic Code for Large Alphabet Sources with Asymmetrical Distributions .
International Symposium on Information Theory,Proceedings.IEEE , 2002, Lausanne, Switzelend, p.319.
download text in PS format

Boris Ryabko, Elena Matchikina . Efficient Methods for Generating Approximately Equiprobable Random Bits .
International Symposium on Information Theory,Proceedings.IEEE , 2002, Lausanne, Switzelend, p. 407
download text in PS format

Boris Ryabko, Andrey Fionov . Adaptive Arithmetic Coding for Changing Statistics: Randomization vs Space .
International Symposium on Information Theory,Proceedings.IEEE , 2002, Lausanne, Switzelend, p. 321.

Ryabko, B., Suzuki J. Comparing the Multilevel Pattern Matching Code and the Lempel-Ziv Codes. International Symposium on Information Theory,Proceedings.IEEE , 2001. Washington.
download text in PS format

Ryabko, B.Topsoe, F.Universal Coding for Sources with Partially Ordered Probabilities.
International Symposium on Information Theory, 2001. Washington. Proceedings.IEEE , download text in PS format

Ryabko, B. The simple ideal cipher system.
International Symposium on Information Theory, 2000. Proceedings.IEEE , Sorrento, Italy, P.240.

Ryabko, B.; Topsoe, F. On asymptotically optimal methods of prediction and adaptive coding for Markov sources with unknown memory.
International Symposium on Information Theory, 2000. Proceedings. IEEE , Sorrento, Italy, P. 71.

Fedotov, A.; Ryabko, B. The estimate for the cost of a search tree constructed on an arbitrary set of binary words
International Symposium on Information Theory, 2000. Proceedings. IEEE , Sorrento, Italy, ,P. 13.

Ryabko, B.; Matchikina, E. Fast and efficient construction of an unbiased random sequences.
Information Theory, Proceedings. 1998 IEEE International Symposium,Cambridge, USA, P. 472

Ryabko, B.; Fionov, A. Fast homophonic coding with logarithmic memory size.
Information Theory, Proceedings. 1998 IEEE International Symposium. Cambridge, USA P. 52

Ryabko, B.; Topsoe, F. On asymptotically optimal methods of prediction and adaptive coding.
Information Theory, Proceedings. 1998 IEEE International Symposium. Cambridge, USA, P. 316.

Ryabko, B.; Reznikova, Zh. Experimental study of ants numerical aptitude based on the ideas of the information theory.
Information Theory. Proceedings., 1997 IEEE International Symposium.Ulme, Germany, P. 136

Ryabko, B.; Fionov, A. Decreasing redundancy of homophonic coding.
Information Theory. Proceedings., 1997 IEEE International Symposium.Ulme, Germany P. 94

Ryabko, B. The imaginary sliding window.
Information Theory. Proceedings., 1997 IEEE International Symposium, Ulme, Germany, P. 63.