Abstract
A novel family of structured low-density parity-check (LDPC) codes with block-circulant parity-check matrices that consist of permutation blocks is proposed. The codes from this family are based on new combinatorial objects termed cycle-invariant difference sets, and they have low storage requirements, fast encoding algorithms, and girth of at least six. Most importantly, they tend to outperform many other known structured LDPCs of comparable rate and length.
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 callMore From: IEEE Journal of Selected Topics in Quantum Electronics
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.
