Extended synchronizing codewords for binary prefix codes

Wai Man Lam, Sanjeev R. Kulkarni

Research output: Contribution to journalArticle

18 Scopus citations

Abstract

Synchronizing codewords (SC's) have been previously studied as a means to stop error propagation in variable-length codes. However, SC's retain one disadvantage: the symbols after the SC may be put in the wrong positions since the number of decoded symbols before the SC can be different from the original number due to channel errors. Thus we propose the idea of extended synchronizing codewords (ESC's) which can overcome the drawback of SC's. After the decoder receives an ESC, the decoder correctly knows it is in synchronization, regardless of the preceding slippage. We derive some of the essential properties of ESC's and provide several upper bounds on the amount of overhead needed in designing a code with an ESC.

Original languageEnglish (US)
Pages (from-to)984-987
Number of pages4
JournalIEEE Transactions on Information Theory
Volume42
Issue number3
DOIs
StatePublished - Dec 1 1996

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Keywords

  • Errors
  • Markers
  • Prefix codes
  • Synchronization
  • Synchronizing codewords
  • Variable-length coding

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

  • Cite this