Algorithm 4 Decoding process.

1:Obtaining the codeword combinations of chunk i 2:Take $t=i$ 3: if $r^{\left(t\right)}=D$ and $\mathrm{d}.\mathrm{s}\left(t\right)=$ false then 4: Conduct decoding and update $\mathrm{d}.\mathrm{s}\left(t\right)=$ true, $t=t-1$ 5: Go to 3 6: else 7: if $t-1>0$ and $\mathrm{d}.\mathrm{s}(t-1)=$ true and $\mathrm{l}.\mathrm{b}.\mathrm{s}.\mathrm{s}\left(t\right)=$ false then 8:  Conduct l.b.s and update $\mathrm{l}.\mathrm{b}.\mathrm{s}.\mathrm{s}\left(t\right)=$ true 9: end if 10: if $\mathrm{d}.\mathrm{s}(t+1)=$ true and $\mathrm{r}.\mathrm{b}.\mathrm{s}.\mathrm{s}\left(t\right)=$ false then 11:  Conduct r.b.s and update $\mathrm{r}.\mathrm{b}.\mathrm{s}.\mathrm{s}\left(t\right)=$ true 12: end if 13: if $r^{\left(t\right)}=D$ and $\mathrm{d}.\mathrm{s}\left(t\right)=$ false then 14:  Conduct decoding and   update $\mathrm{d}.\mathrm{s}\left(t\right)=$ true, $t=t-1$ 15:  Go to 3 16: else 17:  if $\mathrm{l}.\mathrm{b}.\mathrm{s}.\mathrm{s}\left(t\right)=$ false and $t-1>0$   and $\mathrm{d}.\mathrm{s}(t-1)=$ false then 18:   Conduct co.cs to obtain ch.cs with length $\varphi$ 19:   if $\mathrm{d}.\mathrm{s}(\mathrm{ch}.\mathrm{cs})=$ true then 20:    Conduct decoding and     update $\mathrm{d}.\mathrm{s}(t-\varphi +1:t)=$ true, $t=t-\varphi$ 21:    Go to 3 22:   end if 23:  end if 24: end if 25: end if 26:Wait to receive the codeword combinations of chunk $i+1$