Minimax noiseless universal coding for Markov sources

DOI10.1109/TIT.1983.1056652zbMath0502.94002OpenAlexW2069074906MaRDI QIDQ3968874

Lee D. Davisson

Publication date: 1983

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

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

zbMATH Keywords

statesdistributionupper boundlower boundblock sizeMarkov sourceMarkov order

Mathematics Subject Classification ID

Combinatorial codes (94B25) Error probability in coding theory (94B70) Source coding (94A29)

Related Items

Predictive stochastic complexity and model estimation for finite-state processes, Data compression and histograms