On Variable Length Codes for Iterative Source/Channel Decoding
DCC '01 Proceedings of the Data Compression Conference
Iterative joint source-channel decoding of variable-length codes using residual source redundancy
IEEE Transactions on Wireless Communications
Joint source-channel turbo coding for binary Markov sources
IEEE Transactions on Wireless Communications
Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Joint source-channel turbo decoding of entropy-coded sources
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Variable length codes (VLCs), used in data compression, are very sensitive to error propagation in the presence of noisy channels. Addressing this problem with joint source-channel turbo techniques has been proposed in the literature and looks quite promising. But to date, most code-related conclusions are based on simulations. This paper states and proves several theoretical results about the robustness of prefix VLCs concatenated with linear error correcting codes (ECC), assuming a maximum likelihood decoder. Especially, an approximate and asymptotically tight distance spectrum of the concatenated code (VLC+ECC) is rigorously developed. Together with the union bound, it provides upper bounds on the symbol and frame/packet error rates.