Abstract
Two different ways of obtaining generalised low-density parity-check (LDPC) codes are considered. Lower bounds on the minimum distance, stopping distance and pseudodistance are derived for these codes using graph-based analysis. These bounds are generalisations of Tanner's bit- and parity-oriented bound for simple (LDPC) codes. The new bounds are useful in predicting the performance of generalised LDPC codes under maximum-likelihood decoding, graph-based iterative decoding and linear programming decoding, and rely on the connectivity of the Tanner graph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Information and Coding Theory
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.