Delay and Redundancy in Lossless Source Coding

Details Delay and Redundancy in Lossless Source Coding Delay and Redundancy in Lossless Source Coding

2010-12-20

arxiv.org/abs/1012.4225v1

Computer Science

Information Theory

Submitted to the IEEE Transactions on Information Theory

Scientific paper

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, which in this case is identified with the block or maximal phrase length, respectively. In stark contrast, it is shown that the redundancy can be made to decay exponentially with the delay constraint. The corresponding redundancy-delay exponent is shown to be bounded from below by the R\'enyi entropy of order 2 of the source, and from above (for almost all sources) in terms of the minimal source symbol probability and the alphabet size.

Affiliated with

Also associated with

No associations

Rating

Delay and Redundancy in Lossless Source Coding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Delay and Redundancy in Lossless Source Coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Delay and Redundancy in Lossless Source Coding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-452867