Abstract
In this paper we investigate the cycle properties of regular quasi-cyclic low-density parity-check (QC-LDPC) codes. Using the sequence representation, we analyze the conditions for short cycles to exist in regular QC-LDPC codes and then give necessary conditions for avoiding short cycles in terms of their parameters. Numerical results show that our bounds on the number of rows in the parity-check matrices for regular QC-LDPC codes without cycles of length 4 or 6 are tighter than any other known bounds.
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.
