Coding for a binary independent piecewise-identically-distributed source
From MaRDI portal
Publication:4336402
DOI10.1109/18.556608zbMath0872.94019OpenAlexW2149988068MaRDI QIDQ4336402
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
redundancyarithmetic codingtransitionindependent piecewise-identically-distributed sourceMerhav lower bounduniversal noiseless source coding
Related Items (4)
Unnamed Item ⋮ Asymptotic property of universal lossless coding for independent piecewise identically distributed sources ⋮ A tree-weighting approach to sequential decision problems with multiplicative loss ⋮ UNIVERSAL SEMICONSTANT REBALANCED PORTFOLIOS
This page was built for publication: Coding for a binary independent piecewise-identically-distributed source