Boris Ryabko

Prof. Boris Ryabko

Federal Research Center for Information and Computational Technologies
orcid

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 November 2009 in Entropy
Verified
Journal Article
Open access
PDF file
Boris RyabkoBoris Ryabko
Boris Ryabko
ZRZhanna Reznikova
Zhanna Reznikova
In this review we integrate results of long term experimental study on ant “language” and intelligence which were fully based on fundamental ideas of Information Theory, such as the Shannon entropy, the Kolmogorov complexity, and the Shannon’s equation connecting the length of a message (l) and its frequency (p), i.e., l = –log p for rational communication systems. This approach enabled us to obtain the following important results on ants’ communication and intelligence: (i) to reveal “distant homing” in ants, that is, their ability to transfer information about remote events; (ii) to estimate the rate of information transmission; (iii) to reveal that ants are able to grasp regularities and to use them for “compression” of information; (iv) to reveal that ants are able to transfer to each other the information about the number of objects; (v) to discover that ants can add and subtract small numbers. The obtained results show that information theory is not only excellent mathematical theory, but many of its results may be considered as Nature laws.

11 March 2010 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
DRDaniil Ryabko
Daniil Ryabko
Boris RyabkoBoris Ryabko
Boris Ryabko
In this work, a method for statistical analysis of time series is proposed, which is used to obtain solutions to some classical problems of mathematical statistics under the only assumption that the process generating the data is stationary ergodic. Namely, three problems are considered: goodness-of-fit (or identity) testing, process classification, and the change point problem. For each of the problems a test is constructed that is asymptotically accurate for the case when the data is generated by stationary ergodic processes. The tests are based on empirical estimates of distributional distance.


1 June 2009 in Problems of Information Transmission
Verified
Journal Article
Closed access
PDF file
Boris RyabkoBoris Ryabko
Boris Ryabko
DRD. B. Ryabko
D. B. Ryabko
In 1998 C. Cachin proposed an information-theoretic approach to steganography. In particular, in the framework of this approach, so-called perfectly secure stegosystems were defined, where messages that carry and do not carry hidden information are statistically indistinguishable. There was also described a universal steganographic system, for which this property holds only asymptotically, as the message length grows, while encoding and decoding complexity increases exponentially. (By definition, a system is universal if it is also applicable in the case where probabilistic characteristics of messages used to transmit hidden information are not known completely.) In the present paper we propose a universal steganographic system where messages that carry and do not carry hidden information are statistically indistinguishable, while transmission rate of “hidden” information approaches the limit, the Shannon entropy of the source used to “embed” the hidden information.

3 May 2012 in Theory of Computing Systems
Verified
Journal Article
Closed access
PDF file
Boris RyabkoBoris Ryabko
Boris Ryabko
ZRZhanna Reznikova
Zhanna Reznikova
ADAlexey Druzyaka
Alexey Druzyaka
SPSofia Panteleeva
Sofia Panteleeva

30 June 2012 in Performance Evaluation
Verified
Journal Article
Closed access
Boris RyabkoBoris Ryabko
Boris Ryabko