Tradeoff Between Source and Channel Coding for Erasure Channels

Details Tradeoff Between Source and Channel Coding for Erasure Channels Tradeoff Between Source and Channel Coding for Erasure Channels

2005-06-10

arxiv.org/abs/cs/0506037v1

Computer Science

Information Theory

International Symposium on Information Theory, Adelaide, Sept. 2005(accepted)

Scientific paper

In this paper, we investigate the optimal tradeoff between source and channel coding for channels with bit or packet erasure. Upper and Lower bounds on the optimal channel coding rate are computed to achieve minimal end-to-end distortion. The bounds are calculated based on a combination of sphere packing, straight line and expurgated error exponents and also high rate vector quantization theory. By modeling a packet erasure channel in terms of an equivalent bit erasure channel, we obtain bounds on the packet size for a specified limit on the distortion.

Affiliated with

Also associated with

No associations

Rating

Tradeoff Between Source and Channel Coding for Erasure Channels 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 Tradeoff Between Source and Channel Coding for Erasure Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tradeoff Between Source and Channel Coding for Erasure Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-666404