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 1:
c = del_correct1 (n, a, y, j, c_j)
Input:
n, a, y, j, c_j.
Output:
$c = (c_{1}, c_{2}, \dots, c_{n}) \in C (n, 4)$ .
1:
Syn_new = $\sum_{i = 1}^{j - 1} i c_{j, i}^{n - 1} + j c_{i} + \sum_{i = j + 1}^{n - 1} i c_{j, i}^{n - 1}$ mod (8n + 1)
2:
ifSyn_new = a then
3:
c = c₁,c₂,…,c_j−1,c_j,c_{j + 1},…,c_n
4:
else
5:
$j \leftarrow j + 1$
6:
end if