.png){kind=icon}
Return
New Binary Code Design to Correct One Deletion and One Insertion Error
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2023.3274157.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Deletion error
insertion error
error correction code
parallel decoding algorithms
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
Cited Papers
ShareSaveExplaining Agriculture Expansion and Deforestation: Evidence from the Brazilian Amazon - 1980/98
OAAI
OAAIShareSaveShareSaveSubstitution reactions of [CuI(AsPh3)3X] (X = Cl, Br or I) with 3-phenyl-2-thioxoimidazolidin-4-one (ptiH) and 5-mercapto-1-phenyl-1,2,3-4-tetrazole (mptH).png)
Polyhedron
PolyhedronIF0
PREAI
ShareSave
ShareSaveShareSave
View more