• DocumentCode
    1385837
  • Title

    An Efficient Algorithm for Searching Optimal Shortened Cyclic Single-Burst-Correcting Codes

  • Author

    Villalba, L. J García ; Cortez, J. R Fuentes ; Orozco, A. L Sandoval ; Blaum, M.

  • Author_Institution
    Dept. of Software Eng. & Artificial Intell. (DISIA), Univ. Complutense de Madrid (UCM), Madrid, Spain
  • Volume
    16
  • Issue
    1
  • fYear
    2012
  • fDate
    1/1/2012 12:00:00 AM
  • Firstpage
    89
  • Lastpage
    91
  • Abstract
    An efficient algorithm searching for the best (shortened) cyclic burst-correcting codes is presented. The efficiency of the algorithm stems from the fact that no repeated syndromes are computed. It is shown how to achieve this goal by using Gray codes.
  • Keywords
    Golay codes; cyclic codes; error correction codes; Gray codes; error correcting codes; optimal shortened cyclic single-burst-correcting codes; Decoding; Fires; Generators; Polynomials; Reflective binary codes; Systematics; Vectors; Error-correcting codes; all-around (AA) bursts; burst errors; cyclic bursts; cyclic codes; optimal burst-correcting codes; shortened cyclic codes; single burst-correcting codes; wrap-around bursts;
  • fLanguage
    English
  • Journal_Title
    Communications Letters, IEEE
  • Publisher
    ieee
  • ISSN
    1089-7798
  • Type

    jour

  • DOI
    10.1109/LCOMM.2011.111011.112186
  • Filename
    6093688
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1385837