Extended synchronizing codewords for binary prefix codes

  • Authors:
  • Wai-Man Lam;S. R. Kulkarni

  • Affiliations:
  • Thomson Multimedia, Indianapolis, IN;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 1996

Quantified Score

Hi-index 754.84

Visualization

Abstract

Synchronizing codewords (SCs) have been previously studied as a means to stop error propagation in variable-length codes. However, SCs 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 (ESCs) which can overcome the drawback of SCs. 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 ESCs and provide several upper bounds on the amount of overhead needed in designing a code with an ESC