Skip to Main Content
In this paper, we consider the optimal permutation of encoded symbols that will result in the maximum burst erasure efficiency for a given low-density parity-check (LDPC) code under belief propagation (BP) decoding. A novel algorithm is proposed to permute columns of the parity-check matrix to achieve high burst erasure correction efficiencies. This method can be applied to any linear code to increase its burst-erasure efficiency while retaining its random-error correction capability. Results show that the algorithm outperforms previous methods.