• DocumentCode
    1779927
  • Title

    Codes for correcting three or more adjacent deletions or insertions

  • Author

    Ling Cheng ; Swart, T.G. ; Ferreira, H.C. ; Abdel-Ghaffar, Khaled A. S.

  • Author_Institution
    Univ. of the Witwatersrand, Johannesburg, South Africa
  • fYear
    2014
  • fDate
    June 29 2014-July 4 2014
  • Firstpage
    1246
  • Lastpage
    1250
  • Abstract
    Codes are presented that can correct the deletion or the insertion of a predetermined number of adjacent bits greater than or equal to three. This extends the constructions of codes beyond those proposed by Levenshtein fifty years ago to correct one or two adjacent deletions or insertions.
  • Keywords
    interleaved codes; adjacent bits; adjacent deletions; adjacent insertions; correction codes; interleaving principle; predetermined number; Educational institutions; Electronic mail; Indexes; Information theory; Receivers; Upper bound; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory (ISIT), 2014 IEEE International Symposium on
  • Conference_Location
    Honolulu, HI
  • Type

    conf

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