Second-order noiseless source coding theorems

DOI10.1109/18.605604zbMath0878.94035OpenAlexW2155973165MaRDI QIDQ4345640

Ioannis Kontoyiannis

Publication date: 23 July 1997

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.605604

zbMATH Keywords

convergence ratesMarkov chainslaw of the iterated logarithmsource codingcoding varianceone-sided central limit theorem

Mathematics Subject Classification ID

Limit theorems in probability theory (60F99) Markov processes (60J99) Coding theorems (Shannon theory) (94A24)

Related Items

Hurst Index of Functions of Long-Range-Dependent Markov Chains ⋮ Estimation of Entropy and Mutual Information ⋮ Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields ⋮ Renewal theory in the analysis of tries and strings