Sciweavers

Share
DCC
2008
IEEE

A Lower Bound on the Redundancy of Arithmetic-Type Delay Constrained Coding

9 years 1 months ago
A Lower Bound on the Redundancy of Arithmetic-Type Delay Constrained Coding
In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite endto-end strict delay constraint. It was shown that the redundancy decays exponentially with the delay constraint and that the redundancy-delay exponent is lower bounded by log(1/) where is the probability of the most likely source symbol. In this work, we prove a corresponding upper bound for the redundancy-delay exponent, C ? log 1/ where is the probability of the least likely source symbol. This bound is valid for almost all memoryless sources and for all arithmetic-type (possibly time-varying, memory dependent) lossless delay-constrained encoders. We also shed some light on the difference between our exponential bounds and the polynomial O(d-5/3) upper bound on the redundancy with an average delay constraint d, derived in an elegant paper by Bugeaud, Drmota and Szpankowski for another class of variable-to-variable encoders, and show th...
Eado Meron, Ofer Shayevitz, Meir Feder, Ram Zamir
Added 25 Dec 2009
Updated 25 Dec 2009
Type Conference
Year 2008
Where DCC
Authors Eado Meron, Ofer Shayevitz, Meir Feder, Ram Zamir
Comments (0)
books