Low-complexity sequential lossless coding for piecewise-stationary memoryless sources

DOI10.1109/18.771150MaRDI QIDQ4701408zbMATH OpenOpenAlexFDO

Authors Gil I. Shamir, Neri Merhav

Publication date 21 November 1999

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

Full work available at URL https://semanticscholar.org/paper/49435a87dfb6885c3bb708b7024396633fac6219

zbMATH Keywords

change detectionideal code lengthminimum description lengthpiecewise-stationary memoryless sourcesequential lossless compression schemessource block codeuniversal coding

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources. I: The regular case
• Universal Lossless Coding for Sources With Repeating Statistics
• On the redundancy of universal lossless coding for general piecewise stationary sources
• Coding for a binary independent piecewise-identically-distributed source
• A sequential algorithm for the universal coding of finite memory sources

Cited in

(15)

• 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
• Asymptotic property of universal lossless coding for independent piecewise identically distributed sources
• Universal semiconstant rebalanced portfolios
• Universal Lossless Coding for Sources With Repeating Statistics
• On the minimum description length principle for sources with piecewise constant parameters
• Coding for a binary independent piecewise-identically-distributed source
• An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources
• A zero-delay sequential scheme for lossy coding of individual sequences
• On limited-delay lossy coding and filtering of individual sequences
• A Single-Shot Approach to Lossy Source Coding Under Logarithmic Loss
• Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity
• A tree-weighting approach to sequential decision problems with multiplicative loss
• Optimal encoding of non-stationary sources
• Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources

This page was built for publication: Low-complexity sequential lossless coding for piecewise-stationary memoryless sources

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