Tradeoff Between Source and Channel Coding for Erasure Channels
Information Theory
2007-07-13 v1 math.IT
Abstract
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.
Cite
@article{arxiv.cs/0506037,
title = {Tradeoff Between Source and Channel Coding for Erasure Channels},
author = {Sriram N. Kizhakkemadam and Panos Papamichalis and Mandyam Srinath and Dinesh Rajan},
journal= {arXiv preprint arXiv:cs/0506037},
year = {2007}
}
Comments
International Symposium on Information Theory, Adelaide, Sept. 2005(accepted)