Delay and Redundancy in Lossless Source Coding
From MaRDI portal
Publication:2986161
DOI10.1109/TIT.2014.2331954zbMATH Open1360.94213arXiv1012.4225MaRDI QIDQ2986161FDOQ2986161
Eado Meron, Meir Feder, Ram Zamir, Ofer Shayevitz
Publication date: 16 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: The penalty incurred by imposing a finite delay constraint in lossless source coding of a memoryless source is investigated. It is well known that for the so-called block-to-variable and variable-to-variable codes, the redundancy decays at best polynomially with the delay, where in this case the delay is identified with the source block length or maximal source phrase length, respectively. In stark contrast, it is shown that for sequential codes (e.g., a delay-limited arithmetic code) the redundancy can be made to decay exponentially with the delay constraint. The corresponding redundancy-delay exponent is shown to be at least as good as the R'enyi entropy of order 2 of the source, but (for almost all sources) not better than a quantity depending on the minimal source symbol probability and the alphabet size.
Full work available at URL: https://arxiv.org/abs/1012.4225
Recommendations
- On limited-delay lossy coding and filtering of individual sequences
- Near-Optimal Rates for Limited-Delay Universal Lossy Source Coding
- On Zero-Delay Source-Channel Coding
- On the redundancy of trellis lossy source coding
- Coefficient rate and lossy source coding
- scientific article
- On Delayed Sequential Coding of Correlated Sources
- On the redundancy of universal lossless coding for general piecewise stationary sources
- A zero-delay sequential scheme for lossy coding of individual sequences
- Efficient Adaptive Algorithms and Minimax Bounds for Zero-Delay Lossy Source Coding
Cited In (2)
This page was built for publication: Delay and Redundancy in Lossless Source Coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986161)
