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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on communications Ročník 71; číslo 7; s. 1
Hlavní autoři: Khuat, Thi-Huong, Park, Hosung, Kim, Sunghwan
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.07.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2023.3274157