Bounded expected delay in arithmetic coding

Details Bounded expected delay in arithmetic coding Bounded expected delay in arithmetic coding

2006-04-26

arxiv.org/abs/cs/0604106v1

Computer Science

Information Theory

Scientific paper

We address the problem of delay in an arithmetic coding system. Due to the nature of the arithmetic coding process, source sequences causing arbitrarily large encoding or decoding delays exist. This phenomena raises the question of just how large is the expected input to output delay in these systems, i.e., once a source sequence has been encoded, what is the expected number of source letters that should be further encoded to allow full decoding of that sequence. In this paper, we derive several new upper bounds on the expected delay for a memoryless source, which improve upon a known bound due to Gallager. The bounds provided are uniform in the sense of being independent of the sequence's history. In addition, we give a sufficient condition for a source to admit a bounded expected delay, which holds for a stationary ergodic Markov source of any order.

Affiliated with

Also associated with

No associations

Rating

Bounded expected delay in arithmetic 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 Bounded expected delay in arithmetic coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounded expected delay in arithmetic coding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-505052