Codes for correcting three or more adjacent deletions or insertions

Ling Cheng; Theo G. Swart; Hendrik C. Ferreira; Khaled A.S. Abdel-Ghaffar

doi:10.1109/ISIT.2014.6875032

Codes for correcting three or more adjacent deletions or insertions

Ling Cheng, Theo G. Swart, Hendrik C. Ferreira, Khaled A.S. Abdel-Ghaffar

Electrical and Electronic Engineering Science

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

33 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 language	English
Title of host publication	2014 IEEE International Symposium on Information Theory, ISIT 2014
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1246-1250
Number of pages	5
ISBN (Print)	9781479951864
DOIs	https://doi.org/10.1109/ISIT.2014.6875032
Publication status	Published - 2014
Event	2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, HI, United States Duration: 29 Jun 2014 → 4 Jul 2014

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Conference

Conference	2014 IEEE International Symposium on Information Theory, ISIT 2014
Country/Territory	United States
City	Honolulu, HI
Period	29/06/14 → 4/07/14

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2014.6875032

Cite this

Cheng, L., Swart, T. G., Ferreira, H. C., & Abdel-Ghaffar, K. A. S. (2014). Codes for correcting three or more adjacent deletions or insertions. In 2014 IEEE International Symposium on Information Theory, ISIT 2014 (pp. 1246-1250). Article 6875032 (IEEE International Symposium on Information Theory - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2014.6875032

@inproceedings{fab20282e3744fa29aeb387d2eb71e59,

title = "Codes for correcting three or more adjacent deletions or insertions",

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.",

author = "Ling Cheng and Swart, {Theo G.} and Ferreira, {Hendrik C.} and Abdel-Ghaffar, {Khaled A.S.}",

year = "2014",

doi = "10.1109/ISIT.2014.6875032",

language = "English",

isbn = "9781479951864",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1246--1250",

booktitle = "2014 IEEE International Symposium on Information Theory, ISIT 2014",

address = "United States",

note = "2014 IEEE International Symposium on Information Theory, ISIT 2014 ; Conference date: 29-06-2014 Through 04-07-2014",

}

Cheng, L, Swart, TG, Ferreira, HC & Abdel-Ghaffar, KAS 2014, Codes for correcting three or more adjacent deletions or insertions. in 2014 IEEE International Symposium on Information Theory, ISIT 2014., 6875032, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 1246-1250, 2014 IEEE International Symposium on Information Theory, ISIT 2014, Honolulu, HI, United States, 29/06/14. https://doi.org/10.1109/ISIT.2014.6875032

Codes for correcting three or more adjacent deletions or insertions. / Cheng, Ling; Swart, Theo G.; Ferreira, Hendrik C. et al.
2014 IEEE International Symposium on Information Theory, ISIT 2014. Institute of Electrical and Electronics Engineers Inc., 2014. p. 1246-1250 6875032 (IEEE International Symposium on Information Theory - Proceedings).

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

TY - GEN

T1 - Codes for correcting three or more adjacent deletions or insertions

AU - Cheng, Ling

AU - Swart, Theo G.

AU - Ferreira, Hendrik C.

AU - Abdel-Ghaffar, Khaled A.S.

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84906559639&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2014.6875032

DO - 10.1109/ISIT.2014.6875032

M3 - Conference contribution

AN - SCOPUS:84906559639

SN - 9781479951864

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1246

EP - 1250

BT - 2014 IEEE International Symposium on Information Theory, ISIT 2014

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2014 IEEE International Symposium on Information Theory, ISIT 2014

Y2 - 29 June 2014 through 4 July 2014

ER -

Cheng L, Swart TG, Ferreira HC, Abdel-Ghaffar KAS. Codes for correcting three or more adjacent deletions or insertions. In 2014 IEEE International Symposium on Information Theory, ISIT 2014. Institute of Electrical and Electronics Engineers Inc. 2014. p. 1246-1250. 6875032. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/ISIT.2014.6875032

Codes for correcting three or more adjacent deletions or insertions

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this