A Quaternary Code Correcting a Burst of at Most Two Deletion or Insertion Errors in DNA Storage

. 2021 Nov 27;23(12):1592. doi: 10.3390/e23121592

Function 2:
c = del_correct2 (n, a, y, j, c_j + c_j+1)
Input:
n, a, y, j, x_j, x_j+1, c_j + c_j+1.
Output:
$c = (c_{1}, c_{2}, \dots, c_{n}) \in C (n, 4)$ .
1:
Using mapping (10) to obtain c_j, then c_j+1 = c_j + c_j+1 − c_j
2:
Syn_new = $\sum_{i = 1}^{j - 1} i c_{j, i}^{n - 2} + j c_{i} + {(j + 1)}_{c_{j + 1}} + \sum_{i = j + 2}^{n - 2} i c_{j, i}^{n - 2}$ mod (8n + 1)
3:
ifSyn_new = a then
4:
c = c₁,c₂,…,c_j−1,c_j,c_{j + 1},…,c_n
5:
else
6:
$j \leftarrow j + 1$
7:
end if