Coding theorems for individual sequences
From MaRDI portal
Publication:3206858
DOI10.1109/TIT.1978.1055911zbMath0416.94006OpenAlexW2136864990MaRDI QIDQ3206858
Publication date: 1978
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1978.1055911
Related Items (24)
Finite-state dimension ⋮ A diffusion limit for a class of randomly-growing binary trees ⋮ Phenomenology of coupled nonlinear oscillators ⋮ Automatic Kolmogorov complexity, normality, and finite-state dimension revisited ⋮ Unnamed Item ⋮ Quantifying complexity in the minority game ⋮ Lempel-Ziv complexity analysis of one dimensional cellular automata ⋮ Correlation and collective behaviour in Adler-type locally coupled oscillators at the edge of chaos ⋮ Quasi-distinct parsing and optimal compression methods ⋮ Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases ⋮ Computational capabilities at the edge of chaos for one dimensional systems undergoing continuous transitions ⋮ Variance estimators for the Lempel-Ziv entropy rate estimator ⋮ Randomized prediction of individual sequences ⋮ Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees ⋮ Regression Estimation from an Individual Stable Sequence ⋮ On the non-randomness of maximum Lempel Ziv complexity sequences of finite size ⋮ On universal algorithms for classifying and predicting stationary processes ⋮ Creating order in sequence spaces with simple machines ⋮ Quasi-distinct Parsing and Optimal Compression Methods ⋮ Optimal data compression algorithm ⋮ Adaptive game playing using multiplicative weights ⋮ Universal Data Compression Algorithm Based on Approximate String Matching ⋮ A Central Limit Theorem for Non-Overlapping Return Times ⋮ Some remarks on filtering and prediction of stationary processes
This page was built for publication: Coding theorems for individual sequences
