Skip to main navigation Skip to search Skip to main content

Codes for correcting three or more adjacent deletions or insertions

  • Ling Cheng
  • , Theo G. Swart
  • , Hendrik C. Ferreira
  • , Khaled A.S. Abdel-Ghaffar
  • University of the Witwatersrand
  • University of Johannesburg
  • University of California at Davis

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

50 Citations (Scopus)

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.

Original languageEnglish
Title of host publication2014 IEEE International Symposium on Information Theory, ISIT 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1246-1250
Number of pages5
ISBN (Print)9781479951864, 9781479951864
DOIs
Publication statusPublished - 2014
Event2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, HI, United States
Duration: 29 Jun 2014 → 4 Jul 2014

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095
ISSN (Electronic)2157-8117

Conference

Conference2014 IEEE International Symposium on Information Theory, ISIT 2014
Country/TerritoryUnited States
CityHonolulu, HI
Period29/06/14 → 4/07/14

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Codes for correcting three or more adjacent deletions or insertions'. Together they form a unique fingerprint.

Cite this