This paper proposes a novel binary code to correct one insertion and at most two consecutive deletion errors simultaneously occurring in a codeword. Our proposed code is intended first to isolate the possible error cases among all the error scenarios, and then correct the errors. Furthermore, we provide detailed descriptions of the code construction and also suggest a decoding strategy for the proposed code. According to the proposed code,$5\log _{2} n +O(1)$redundancy bits are required to correct one insertion and at most two consecutive deletion errors occurring in a codeword. In addition, a decoding procedure of the proposed code is comprehensively presented for all error scenarios including a single insertion error, an insertion and a deletion error, and an insertion and two consecutive deletion errors.

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.