Coding theorems for individual sequences
From MaRDI portal
Publication:3206858
Cited in
(25)- Correlation and collective behaviour in Adler-type locally coupled oscillators at the edge of chaos
- Quasi-distinct parsing and optimal compression methods
- Quantifying complexity in the minority game
- Some remarks on filtering and prediction of stationary processes
- Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
- A Central Limit Theorem for Non-Overlapping Return Times
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
- Variance of entropy for testing time-varying regimes with an application to meme stocks
- On the non-randomness of maximum Lempel Ziv complexity sequences of finite size
- scientific article; zbMATH DE number 3863086 (Why is no real title available?)
- Regression Estimation from an Individual Stable Sequence
- A diffusion limit for a class of randomly-growing binary trees
- Optimal data compression algorithm
- Finite-state dimension
- On universal algorithms for classifying and predicting stationary processes
- Adaptive game playing using multiplicative weights
- Universal Data Compression Algorithm Based on Approximate String Matching
- Creating order in sequence spaces with simple machines
- Randomized prediction of individual sequences
- Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
- Quasi-distinct Parsing and Optimal Compression Methods
- Lempel-Ziv complexity analysis of one dimensional cellular automata
- Phenomenology of coupled nonlinear oscillators
- Variance estimators for the Lempel-Ziv entropy rate estimator
- Computational capabilities at the edge of chaos for one dimensional systems undergoing continuous transitions
This page was built for publication: Coding theorems for individual sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3206858)
