Coding theorems for individual sequences

DOI10.1109/TIT.1978.1055911MaRDI QIDQ3206858zbMATH OpenOpenAlexFDO

Authors Jacob Ziv

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

zbMATH Keywords

finite state decodersfinite state encodersindividual sequencesnoiseless coding theorems

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

Cited in

(26)

• A diffusion limit for a class of randomly-growing binary trees
• Quantifying complexity in the minority game
• Randomized prediction of individual sequences
• Optimal data compression algorithm
• Adaptive game playing using multiplicative weights
• Finite-state dimension
• Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
• On universal algorithms for classifying and predicting stationary processes
• Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
• 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?)
• Variance estimators for the Lempel-Ziv entropy rate estimator
• Quasi-distinct Parsing and Optimal Compression Methods
• Quasi-distinct parsing and optimal compression methods
• Phenomenology of coupled nonlinear oscillators
• Lempel-Ziv complexity analysis of one dimensional cellular automata
• Regression Estimation from an Individual Stable Sequence
• Computational capabilities at the edge of chaos for one dimensional systems undergoing continuous transitions
• Universal Data Compression Algorithm Based on Approximate String Matching
• A Central Limit Theorem for Non-Overlapping Return Times
• Correlation and collective behaviour in Adler-type locally coupled oscillators at the edge of chaos
• Variance of entropy for testing time-varying regimes with an application to meme stocks
• Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
• Universal almost optimal compression and Slepian-Wolf coding in probabilistic polynomial time
• Creating order in sequence spaces with simple machines
• Some remarks on filtering and prediction of stationary processes

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)