Coding for a binary independent piecewise-identically-distributed source

DOI10.1109/18.556608MaRDI QIDQ4336402zbMATH OpenOpenAlexFDO

Authors Frans M. J. Willems

Publication date 12 May 1997

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

Full work available at URL https://research.tue.nl/nl/publications/coding-for-a-binary-independent-piecewiseidenticallydistributed-source(a3a8153f-4ace-4c3f-a079-a632f8ebe9fc).html

zbMATH Keywords

arithmetic codingindependent piecewise-identically-distributed sourceMerhav lower boundredundancytransitionuniversal noiseless source coding

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Low-complexity sequential lossless coding for piecewise-stationary memoryless sources
• The context-tree weighting method: basic properties
• On the redundancy of universal lossless coding for general piecewise stationary sources
• Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources. I: The regular case
• Universal sequential coding of single messages

Cited in

(9)

• Asymptotic property of universal lossless coding for independent piecewise identically distributed sources
• Universal semiconstant rebalanced portfolios
• Binomial coding in distributed arbitration systems
• scientific article; zbMATH DE number 3543914 (Why is no real title available?)
• Large Alphabet Source Coding Using Independent Component Analysis
• Low-complexity sequential lossless coding for piecewise-stationary memoryless sources
• scientific article; zbMATH DE number 1421009 (Why is no real title available?)
• On asymptotic and finite-time optimality of Bayesian predictors
• A tree-weighting approach to sequential decision problems with multiplicative loss

This page was built for publication: Coding for a binary independent piecewise-identically-distributed source

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336402)