Abstract
By considering a class of combinatorial structures, known as strongly regular $(\alpha,\beta)$-geometries, we define a class of low-density parity-check (LDPC) codes. We derive bounds on minimum distance, rank and girth for the codes from strongly regular $(\alpha,\beta)$-geometrie, which have not previously been proposed for use with iterative decoding. In further, we present performance results for the class of codes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.