On the construction and MAP decoding of optimal variable-length error-correcting codes

Ting Yi Wu*, Po-Ning Chen, Fady Alajaji, Yunghsiang S. Han

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

In this paper, we present a novel algorithm that guarantees of finding a variable-length error-correcting code (VLEC) with minimal average codeword length for a fixed free distance dfree. We also propose a low complexity maximum a posterior (MAP) decoding algorithm for our codes under the premise that the receiver knows the number of codewords being transmitted. The resulting VLEC provides significant gains over other codes from the literature. When compared with separate source-channel tandem codes with identical d free, such as a tandem code consisting of a Huffman source code concatenated with a (2, 1, 4) tail-biting convolutional channel code, our system has only a 0.3 dB performance loss at a bit error rate of 10-5 while requiring significantly less decoding complexity.

Original languageEnglish
Title of host publication2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Pages2223-2227
Number of pages5
DOIs
StatePublished - 26 Oct 2011
Event2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, Russian Federation
Duration: 31 Jul 20115 Aug 2011

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8104

Conference

Conference2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
CountryRussian Federation
CitySt. Petersburg
Period31/07/115/08/11

Fingerprint Dive into the research topics of 'On the construction and MAP decoding of optimal variable-length error-correcting codes'. Together they form a unique fingerprint.

  • Cite this

    Wu, T. Y., Chen, P-N., Alajaji, F., & Han, Y. S. (2011). On the construction and MAP decoding of optimal variable-length error-correcting codes. In 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 (pp. 2223-2227). [6033955] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2011.6033955