Abstract
LDPC codes with iterative decoding based on belief propagation have been shown to achieve astonishing error performance. But no algebraic or geometric method has been found for constructing these codes. Codes that have been found are largely computer generated, especially long codes. In this paper, we present two classes of high rate LDPC codes whose constructions are based on the lines of two-dimensional finite Euclidean and projective geometries, respectively.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
