Extended synchronizing codewords for binary prefix codes

Wai Man Lam, Sanjeev Kulkarni

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

Abstract

When variable length codes, such as Huffman codes, are transmitted through a noisy channel, any bit error can lead to loss of synchronization at the decoder and cause error propagation. Synchronizing codewords (SCs) have been previously proposed to resynchronize the decoder regardless of any preceding synchronization slippage. To overcome the drawbacks of synchronizing codewords, the authors introduce the concept of extended synchronizing codewords.

Original languageEnglish (US)
Title of host publicationProceedings of the 1993 IEEE International Symposium on Information Theory
PublisherPubl by IEEE
Number of pages1
ISBN (Print)0780308786
StatePublished - Jan 1 1993
EventProceedings of the 1993 IEEE International Symposium on Information Theory - San Antonio, TX, USA
Duration: Jan 17 1993Jan 22 1993

Publication series

NameProceedings of the 1993 IEEE International Symposium on Information Theory

Other

OtherProceedings of the 1993 IEEE International Symposium on Information Theory
CitySan Antonio, TX, USA
Period1/17/931/22/93

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Extended synchronizing codewords for binary prefix codes'. Together they form a unique fingerprint.

  • Cite this

    Lam, W. M., & Kulkarni, S. (1993). Extended synchronizing codewords for binary prefix codes. In Proceedings of the 1993 IEEE International Symposium on Information Theory (Proceedings of the 1993 IEEE International Symposium on Information Theory). Publ by IEEE.