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