Lossless coding for distributed streaming sources

Details Lossless coding for distributed streaming sources Lossless coding for distributed streaming sources

2006-10-25

arxiv.org/abs/cs/0610144v1

Computer Science

Information Theory

40 pages, 11 figures, submitted to IT Transactions

Scientific paper

Distributed source coding is traditionally viewed in the block coding context -- all the source symbols are known in advance at the encoders. This paper instead considers a streaming setting in which iid source symbol pairs are revealed to the separate encoders in real time and need to be reconstructed at the decoder with some tolerable end-to-end delay using finite rate noiseless channels. A sequential random binning argument is used to derive a lower bound on the error exponent with delay and show that both ML decoding and universal decoding achieve the same positive error exponents inside the traditional Slepian-Wolf rate region. The error events are different from the block-coding error events and give rise to slightly different exponents. Because the sequential random binning scheme is also universal over delays, the resulting code eventually reconstructs every source symbol correctly with probability 1.

Affiliated with

Also associated with

No associations

Rating

Lossless coding for distributed streaming sources 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 Lossless coding for distributed streaming sources, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lossless coding for distributed streaming sources will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-378237