Asymptotic property of universal lossless coding for independent piecewise identically distributed sources
From MaRDI portal
Publication:3008560
DOI10.1080/09720529.2010.10698301zbMath1217.94087OpenAlexW2020684654MaRDI QIDQ3008560
Tota Suko, Toshiyasu Matsushima, Shigeichi Hirasawa
Publication date: 22 June 2011
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: http://www.connectjournals.com/file_html_pdf/797804H_jdmsc358_383-391A.pdf
Cites Work
- Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources .I. The regular case
- A class of distortionless codes designed by Bayes decision theory
- Information-theoretic asymptotics of Bayes methods
- Universal coding, information, prediction, and estimation
- On the minimum description length principle for sources with piecewise constant parameters
- Coding for a binary independent piecewise-identically-distributed source
- Low-complexity sequential lossless coding for piecewise-stationary memoryless sources
- The context-tree weighting method: basic properties