Abstract

This letter presents a class of quasi-cyclic (QC) low-density parity-check (LDPC) codes which are efficiently encodable and have better memory efficiency than other randomly constructed QC-LDPC codes. The parity-check matrix of the codes is obtained from a block circulant matrix that is generated from a self-reciprocal generator polynomial of a maximum distance separable (MDS) code by replacing some of its block entries by all zero matrices. We show by simulations that the codes can achieve excellent error performance.

Full Text
Paper version not known

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 call

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.