New Binary Code Design to Correct One Deletion and One Insertion Error

In this paper, we propose a newly constructed binary code to correct one deletion and one insertion error that simultaneously occur at any position in a codeword. We first investigated all cases of one deletion and one insertion error. Three constraints in the proposed construction were used for det...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on communications Vol. 71; no. 7; p. 1
Main Authors:	Khuat, Thi-Huong, Park, Hosung, Kim, Sunghwan
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.07.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Binary codes Codes Decoding Deletion deletion error Error correction error correction code Indexes Insertion insertion error parallel decoding algorithms Synchronization Systems engineering and theory Termination of employment
ISSN:	0090-6778, 1558-0857
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	In this paper, we propose a newly constructed binary code to correct one deletion and one insertion error that simultaneously occur at any position in a codeword. We first investigated all cases of one deletion and one insertion error. Three constraints in the proposed construction were used for determining the bit values and positions of all error cases. Furthermore, we propose the decoding procedure with two parallel decoding algorithms and explain the specific decoding procedure. To the best of the authors' knowledge, our work is the first trial to provide an efficient code construction design to correct one deletion and one insertion error occurring in a codeword.
AbstractList	In this paper, we propose a newly constructed binary code to correct one deletion and one insertion error that simultaneously occur at any position in a codeword. We first investigated all cases of one deletion and one insertion error. Three constraints in the proposed construction were used for determining the bit values and positions of all error cases. Furthermore, we propose the decoding procedure with two parallel decoding algorithms and explain the specific decoding procedure. To the best of the authors’ knowledge, our work is the first trial to provide an efficient code construction design to correct one deletion and one insertion error occurring in a codeword.
Author	Park, Hosung Khuat, Thi-Huong Kim, Sunghwan
Author_xml	– sequence: 1 givenname: Thi-Huong orcidid: 0000-0002-8800-8511 surname: Khuat fullname: Khuat, Thi-Huong organization: Department of Electrical, Electronic and Computer Engineering, University of Ulsan, Republic of Korea – sequence: 2 givenname: Hosung orcidid: 0000-0001-7854-7792 surname: Park fullname: Park, Hosung organization: Department of Computer Engineering and Department of ICT Convergence System Engineering, Chonnam National University, Gwangju, South Korea – sequence: 3 givenname: Sunghwan orcidid: 0000-0003-1762-5915 surname: Kim fullname: Kim, Sunghwan organization: Department of Electrical, Electronic and Computer Engineering, University of Ulsan, Republic of Korea
BookMark	eNp9kEFPwjAUxxuDiYB-AeNhiedh29eu21EnKAnIhXtTujczgi22I8Zv7wYcjAdPzfvn_3t9-Y3IwHmHhNwyOmGMFg_rcrVcTjjlMAGuBJPqggyZlHlKc6kGZEhpQdNMqfyKjGLcUkoFBRiS2Rt-JU-NM-E7KX2FyTPG5t0lre_GENC2ycr16Q7bxrvEuOoYzF3EcEymIfhwTS5rs4t4c37HZD2brsvXdLF6mZePi9TyImtTjsAYVAUYvmHIZW2MzWpuQQArUFY8s6zmAgVlFdiN6iqyRkZlJepM5TAm96e1--A_DxhbvfWH4LofNc9BMQCRi66Vn1o2-BgD1to2remPbYNpdppR3UvTR2m6l6bP0jqU_0H3ofno5PwP3Z2gBhF_AYwzARR-AHv0eKY
CODEN	IECMBT
CitedBy_id	crossref_primary_10_1109_TCOMM_2024_3487052 crossref_primary_10_1109_TCOMM_2024_3506918 crossref_primary_10_1109_TIT_2024_3445929
Cites_doi	10.1109/TIT.2020.3028702 10.1109/ISIT44484.2020.9173986 10.1109/TIT.2021.3069446 10.1109/TCOMM.2022.3146285 10.1109/TIT.1984.1056962 10.1016/j.procs.2016.05.398 10.1109/TIT.2018.2876281 10.1109/TIT.2020.3036284 10.1109/TIT.2017.2746566 10.1109/TIT.2011.2174961 10.1109/18.971760 10.1109/TCOMM.2018.2886354 10.1109/TIT.2017.2661747
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
DBID	97E RIA RIE AAYXX CITATION 7SP 8FD L7M
DOI	10.1109/TCOMM.2023.3274157
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE/IET Electronic Library (IEL) (UW System Shared) CrossRef Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace
DatabaseTitle	CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts
DatabaseTitleList	Technology Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1558-0857
EndPage	1
ExternalDocumentID	10_1109_TCOMM_2023_3274157 10121430
Genre	orig-research
GrantInformation_xml	– fundername: National Research Foundation of Korea grantid: NRF-2022M3C1A3081366; NRF-2023R1A2C1003546 funderid: 10.13039/501100003725
GroupedDBID	-~X .DC 0R~ 29I 4.4 5GY 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK ACNCT AENEX AGQYO AHBIQ AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS HZ~ IES IFIPE IPLJI JAVBF LAI M43 MS~ O9- OCL P2P RIA RIE RNS TAE TN5 ZCA 3EH 5VS AAYXX ABFSI ACKIV AETIX AGSQL AI. AIBXA ALLEH CITATION E.L EJD H~9 IAAWW IBMZZ ICLAB IFJZH VH1 ZCG 7SP 8FD L7M
ID	FETCH-LOGICAL-c296t-2e3113d93a2b1e25faac6f2c34319e5d26c1f24e401d3cb7e255fe105d4f6783
IEDL.DBID	RIE
ISICitedReferencesCount	3
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001035493400003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0090-6778
IngestDate	Mon Jun 30 10:09:23 EDT 2025 Tue Nov 18 21:07:04 EST 2025 Sat Nov 29 04:08:26 EST 2025 Wed Aug 27 02:18:22 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	7
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c296t-2e3113d93a2b1e25faac6f2c34319e5d26c1f24e401d3cb7e255fe105d4f6783
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-8800-8511 0000-0001-7854-7792 0000-0003-1762-5915
PQID	2837133484
PQPubID	85472
PageCount	1
ParticipantIDs	proquest_journals_2837133484 crossref_citationtrail_10_1109_TCOMM_2023_3274157 crossref_primary_10_1109_TCOMM_2023_3274157 ieee_primary_10121430
PublicationCentury	2000
PublicationDate	2023-07-01
PublicationDateYYYYMMDD	2023-07-01
PublicationDate_xml	– month: 07 year: 2023 text: 2023-07-01 day: 01
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE transactions on communications
PublicationTitleAbbrev	TCOMM
PublicationYear	2023
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref13 ref12 ref15 ref14 Varshamov (ref2) 1965; 161 Cheng (ref5) ref11 ref10 ref1 Levenshtein (ref4) 1970; 19 ref17 ref16 ref8 ref7 Levenshtein (ref3) 1966; 10 ref9 ref6
References_xml	– ident: ref9 doi: 10.1109/TIT.2020.3028702 – volume: 161 start-page: 288 issue: 3 year: 1965 ident: ref2 article-title: A code that corrects single asymmetric errors publication-title: Automatika I Telemkhanika – ident: ref10 doi: 10.1109/ISIT44484.2020.9173986 – ident: ref8 doi: 10.1109/TIT.2021.3069446 – ident: ref17 doi: 10.1109/TCOMM.2022.3146285 – volume: 10 start-page: 707 issue: 8 year: 1966 ident: ref3 article-title: Binary codes capable of correcting deletions, insertions, and reversals publication-title: Sov. Phys.-Dokl. – ident: ref1 doi: 10.1109/TIT.1984.1056962 – ident: ref15 doi: 10.1016/j.procs.2016.05.398 – ident: ref7 doi: 10.1109/TIT.2018.2876281 – ident: ref16 doi: 10.1109/TIT.2020.3036284 – ident: ref11 doi: 10.1109/TIT.2017.2746566 – ident: ref13 doi: 10.1109/TIT.2011.2174961 – ident: ref12 doi: 10.1109/18.971760 – volume: 19 start-page: 298 year: 1970 ident: ref4 article-title: Asymptotically optimum binary codes with correction for losses of one or two adjacent bits publication-title: Syst. Theory Res. – ident: ref14 doi: 10.1109/TCOMM.2018.2886354 – start-page: 1246 volume-title: Proc. ISIT ident: ref5 article-title: Codes for correcting three or more consecutive deletions or insertions – ident: ref6 doi: 10.1109/TIT.2017.2661747
SSID	ssj0004033
Score	2.4372416
Snippet	In this paper, we propose a newly constructed binary code to correct one deletion and one insertion error that simultaneously occur at any position in a...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	1
SubjectTerms	Algorithms Binary codes Codes Decoding Deletion deletion error Error correction error correction code Indexes Insertion insertion error parallel decoding algorithms Synchronization Systems engineering and theory Termination of employment
Title	New Binary Code Design to Correct One Deletion and One Insertion Error
URI	https://ieeexplore.ieee.org/document/10121430 https://www.proquest.com/docview/2837133484
Volume	71
WOSCitedRecordID	wos001035493400003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-0857 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004033 issn: 0090-6778 databaseCode: RIE dateStart: 19720101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB60eNCDb7FaZQ_eJG2ym9cetbYo2NZDD70tyT5AkETS1N_vzibVgih4S5bZEGaTeezO9w3ADZdcS86lZ0N749kIPPJyRpmXIpsUtWkLbUhcn5PpNF0s-EsLVndYGK21Kz7Tfbx0Z_mqlCvcKhsgF5X17zZD306SpAFrfYMgfdZSTmI9e5KuETI-H8yHs8mkj43C-wzpWtAXbXgh11blhy12DmZ88M9XO4T9NpIkd83SH8GWLo5hb4Nf8ATG1oSRe4e4JcNSafLg6jVIXdrbCm0dmRU4igzcZUGyQrmBpwLP6HFkVFVldQrz8Wg-fPTaxgmepDyuPapZEDDFWUbzQNPIZJmMDZXMRgtcR4rGMjA01Da3UkzmiRWJjLaRlgqNdV7sDDpFWehzIExi43SZplkah4aqLM5jnvoyZ77O_MR0IVjrUciWVBx7W7wJl1z4XDjdC9S9aHXfhduvOe8Npcaf0qeo7Q3JRtFd6K3XS7S_3VIglU-A2OLw4pdpl7CLT28KbnvQqauVvoId-VG_Lqtr90V9ArcPxMg
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEF6kCurBt1itugdvkjbZzWuPWlta7MNDDr0tyT5AkETS1N_vzibVgih4S5ZZEmaTeezO9w1Cd0wwJRgTjgnttWMi8MDJKKFODGxSxKQtpCZxnUSzWbxYsJcGrG6xMEopW3ymunBpz_JlIVawVdYDLirj302Gvh34PvFquNY3DNKlDekkVLRH8Roj47Je0p9Pp11oFd6lQNgC3mjDD9nGKj-ssXUxw8N_vtwROmhiSfxQL_4x2lL5CdrfYBg8RUNjxPCjxdzifiEVfrIVG7gqzG0J1g7PcxgFDu4ix2ku7cA4h1N6GBmUZVGeoWQ4SPojp2md4AjCwsohinoelYymJPMUCXSailATQU28wFQgSSg8TXxlsitJRRYZkUArE2tJXxv3Rc9RKy9ydYEwFdA6XcRxGoe-JjINs5DFrsioq1I30m3krfXIRUMrDt0t3rhNL1zGre456J43um-j-6857zWpxp_SZ6DtDcla0W3UWa8Xb368JQcyHw_Qxf7lL9Nu0e4omU74ZDx7vkJ78KS6_LaDWlW5UtdoR3xUr8vyxn5dnyE-yA8
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=New+Binary+Code+Design+to+Correct+One+Deletion+and+One+Insertion+Error&rft.jtitle=IEEE+transactions+on+communications&rft.au=Khuat%2C+Thi-Huong&rft.au=Park%2C+Hosung&rft.au=Kim%2C+Sunghwan&rft.date=2023-07-01&rft.pub=IEEE&rft.issn=0090-6778&rft.spage=1&rft.epage=1&rft_id=info:doi/10.1109%2FTCOMM.2023.3274157&rft.externalDocID=10121430
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0090-6778&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0090-6778&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0090-6778&client=summon