• DocumentCode
    1523546
  • Title

    Event error control codes and their applications

  • Author

    Patapoutian, Ara ; Shen, Ba-Zhong ; McEwen, Peter A.

  • Author_Institution
    Quantum Corp., Shrewsbury, MA, USA
  • Volume
    47
  • Issue
    6
  • fYear
    2001
  • fDate
    9/1/2001 12:00:00 AM
  • Firstpage
    2595
  • Lastpage
    2603
  • Abstract
    Burst error detection codes and cyclic redundancy check (CRC) codes are generalized to event-error detection codes, which are useful in various noisy channels. A systematic linear block code is constructed that detects any event error from an arbitrary list of event errors. The result is generalized to detection and correction of multiple event errors. Bounds are found on the minimum number of redundant bits needed to construct such codes. It is shown that, under certain conditions, the linear code construction is optimal. Various applications are discussed, where there is a Markov source or a Markov channel. It is argued that the codes described herein can be employed either as error detection codes, or as distance-enhancing codes when complete decoders are applied. Specific examples covered in this correspondence include hybrid automatic repeat request (ARQ) systems, intersymbol interference (ISI) channels, and Gilbert (1958) channels
  • Keywords
    Markov processes; automatic repeat request; block codes; decoding; error correction codes; error detection codes; intersymbol interference; linear codes; noise; telecommunication channels; CRC codes; Gilbert channels; ISI channels; Markov channel; Markov source; bounds; burst error detection codes; cyclic redundancy check codes; decoders; distance-enhancing codes; error detection codes; event error control codes; event-error correction; event-error detection codes; hybrid ARQ systems; hybrid automatic repeat request; intersymbol interference; multiple event errors; noisy channels; optimal linear code construction; redundant bits; systematic linear block code; Circuits and systems; Error correction; Graph theory; Hypercubes; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.945275
  • Filename
    945275