We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Construction of Burst-Erasure Efficient LDPC Codes for Use with Belief Propagation Decoding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kan Li ; Univ. of Hawaii at Manoa, Honolulu, HI, USA ; Kavčić, A. ; Erden, M.F.

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.

Published in:

Communications (ICC), 2010 IEEE International Conference on

Date of Conference:

23-27 May 2010