44 citations · 69 across the 30 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2009
Using Kolmogorov Complexity for Understanding Some Limitations on Steganography
Boris Ryabko, Daniil Ryabko
Recently perfectly secure steganographic systems have been described for a wide class of sources of covertexts. The speed of transmission of secret information for these stegosyste…
cs.CC2006★ 1 cited
Fast Enumeration of Combinatorial Objects
Boris Ryabko
The problem of ranking can be described as follows. We have a set of combinatorial objects , such as, say, the k-subsets of n things, and we can imagine that they have been arra…
cs.CC2005
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series
Boris Ryabko, Jaakko Astola, Alex Gammerman
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypotheses testing in a framework of classical mathem…