• DocumentCode
    796300
  • Title

    Extended synchronizing codewords for binary prefix codes

  • Author

    Lam, Wai-Man ; Kulkarni, Sanjeev R.

  • Author_Institution
    Thomson Multimedia, Indianapolis, IN, USA
  • Volume
    42
  • Issue
    3
  • fYear
    1996
  • fDate
    5/1/1996 12:00:00 AM
  • Firstpage
    984
  • Lastpage
    987
  • 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
  • Keywords
    error correction codes; synchronisation; variable length codes; binary prefix codes; channel errors; code design; decoded symbols; error propagation; extended synchronizing codewords; markers; overhead; upper bounds; variable-length codes; Binary codes; Decoding; Entropy coding; Huffman coding; Propagation losses; Redundancy; Robustness; Source coding; Sufficient conditions;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.490560
  • Filename
    490560