1：Initialization

2：while $i=1\le S-1$ do  #decoding segment by segment；

3：   $D\leftarrow n-m/kS$；

4：    for $j=1$ to $D$ do

5：     calculate $B{2}^k$ nodes and sort them；

6：      PATH$\leftarrow$the best $B$$$paths；

7：    end for

8：    for $z=1$ to $B$ do

9：     if CRC PASS

10：       save the path

11：    else

12：      delete

13：   end for

14：    if CRC all failed

15：       declare a decoding failure and feedback ACK message to the sender

16：   end if

17：for $i=1$ to$m+p/k$do

18：  calculate $B{2}^k$ nodes and sort them；

19：  calculate adjoint matrix

20：  if adjoint matrix check is 0

21：    return the path

22：  else

23：   calculate error locating polynomial $\sigma (x)$ and error correction

24：  end if

25：    if adjoint matrix check is 0

26：     return the path

27：    else

28：     declare a decoding failure