The following pages link to Boris Ya. Ryabko (Q522932):
Displaying 50 items.
- Using information theory approach to randomness testing (Q110728) (← links)
- (Q427620) (redirect page) (← links)
- On the efficiency and capacity of computers (Q427621) (← links)
- Time series prediction based on data compression methods (Q522933) (← links)
- (Q556437) (redirect page) (← links)
- Universal codes as a basis for time series testing (Q713722) (← links)
- Constructing perfect steganographic systems (Q719244) (← links)
- Asymptotically optimal perfect steganographic systems (Q734309) (← links)
- Fast enumeration algorithm for words with given constraints on run lengths of ones (Q764093) (← links)
- Application of data compression methods to nonparametric estimation of characteristics of discrete-time stochastic processes (Q941886) (← links)
- Application of information-theoretic tests for the analysis of DNA sequences based on Markov chain models (Q961373) (← links)
- Twice-universal coding (Q1059045) (← links)
- Universal retrieval trees (Q1068838) (← links)
- Prediction of random sequences and universal coding (Q1117199) (← links)
- Coding of a source with unknown but ordered probabilities (Q1140588) (← links)
- Optimal key for taxons ordered in accordance with their frequencies (Q1150315) (← links)
- Data compression by means of a ``book stack'' (Q1155580) (← links)
- A fast method for complete randomization of messages. (Q1271417) (← links)
- A universal search scheme for a single significant factor in a disjunctive model (Q1310729) (← links)
- Algorithmic approach to the prediction problem (Q1310760) (← links)
- The complexity and effectiveness of prediction algorithms (Q1336479) (← links)
- Data compression using an ``imaginary sliding window'' (Q1389283) (← links)
- Fast encoding of low-entropy sources (Q1567728) (← links)
- Efficient conversion of random sequences into equiprobable and independent sequences (Q1567737) (← links)
- Efficient method of adaptive arithmetic coding for sources with large alphabets (Q1569285) (← links)
- A simply realizable ideal cryptographic system (Q1582938) (← links)
- On asymptotically optimal methods of prediction and adaptive coding for Markov sources (Q1599202) (← links)
- A confidence-set approach to signal denoising (Q1731269) (← links)
- Properties of two Shannon's ciphers (Q1744012) (← links)
- Information-theoretic method for classification of texts (Q1752323) (← links)
- An efficient generation method for uniformly distributed random numbers (Q1812336) (← links)
- 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 (Q1814664) (← links)
- Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity (Q1820127) (← links)
- Analysis of the language of ants by information-theoretical methods (Q1820750) (← links)
- A new test for randomness and its application to some cryptographic problems (Q1877842) (← links)
- An effective method for encoding information sources using the fast multiplication algorithm (Q1925337) (← links)
- Application of formal grammars for encoding information sources (Q1925341) (← links)
- Using ideas of Kolmogorov complexity for studying biological texts (Q1946512) (← links)
- Time-universal data compression (Q2004897) (← links)
- Asymptotically most powerful tests for random number generators (Q2059421) (← links)
- Fast adaptive coding algorithm (Q2277426) (← links)
- Information-theoretic approach to estimating the capacity of distributed memory systems (Q2314152) (← links)
- The Vernam cipher is robust to small deviations from randomness (Q2355667) (← links)
- Fast codes for large alphabets (Q2387135) (← links)
- ``Book stack'' as a new statistical test for random numbers (Q2388470) (← links)
- A new type of attacks on block ciphers (Q2432962) (← links)
- Adaptive \(\chi^{2}\) test for discriminating between close hypotheses with a large number of classes and its application to some cryptography problems (Q2487091) (← links)
- Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series (Q2503313) (← links)
- Universal codes as a basis for nonparametric testing of serial independence for time series (Q2507879) (← links)
- Experimental investigation of forecasting methods based on data compression algorithms (Q2577286) (← links)
