Referenced Items are not available for this document.
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
- Page(s):
- 1 - 5
- ISSN :
- 1550-3607
- Print ISBN:
- 978-1-4244-6402-9
- Conference Location :
- Cape Town, South Africa
- Digital Object Identifier :
- 10.1109/ICC.2010.5502511
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
