• DocumentCode
    2947670
  • Title

    Universal Burst Error Correction

  • Author

    Fossorier, Marc

  • Author_Institution
    Dept. of Electr. Eng., Hawaii Univ., Honolulu, HI
  • fYear
    2006
  • fDate
    9-14 July 2006
  • Firstpage
    1969
  • Lastpage
    1973
  • Abstract
    In this paper, it is shown that under very mild assumptions, practically any binary linear block code of length N and dimension K is able to correct any burst of length up to N - K with probability of success Pc = 1 for erasures, and any burst of length up to N - K - m with probability of success Pc ges 1 - N2-m for errors. In both cases, the decoding is based on identifying a string of zeroes in an extended syndrome corresponding to a particular representation of the parity check matrix of the code and its complexity is O(N2) binary operations
  • Keywords
    binary codes; block codes; decoding; error correction codes; linear codes; matrix algebra; binary linear block code; decoding; parity check matrix; universal burst error correction; AWGN channels; Block codes; Decoding; Error correction; Error correction codes; Fading; Parity check codes; Reed-Solomon codes; USA Councils;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2006 IEEE International Symposium on
  • Conference_Location
    Seattle, WA
  • Print_ISBN
    1-4244-0505-X
  • Electronic_ISBN
    1-4244-0504-1
  • Type

    conf

  • DOI
    10.1109/ISIT.2006.261893
  • Filename
    4036312
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2947670