Name
Title | ||
|---|---|---|
Construction of Burst-Erasure Efficient LDPC Codes for Use with Belief Propagation Decoding |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/ICC.2010.5502511 | ICC |
Keywords | Field | DocType |
low density parity check,ldpc code,block codes,error correction,belief propagation,decoding,sparse matrices,linear code | Concatenated error correction code,Sequential decoding,Computer science,Low-density parity-check code,Serial concatenated convolutional codes,Turbo code,Algorithm,Theoretical computer science,Reed–Solomon error correction,Real-time computing,Tornado code,Erasure code | Conference |
ISSN | ISBN | Citations |
1550-3607 | 978-1-4244-6402-9 | 2 |
PageRank | References | Authors |
0.39 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kan Li | 1 | 55 | 14.93 |
| Aleksandar Kavcic | 2 | 191 | 20.83 |
| M. Fatih Erden | 3 | 65 | 8.49 |