Abstract
In this paper, we provide a general form for sparse generator matrices of several families of Quasi-Cyclic Low-Density Parity-Check codes. Codes of this kind have a prominent role in literature and applications due to their ability to achieve excellent performance with limited complexity. While some properties of these codes (like the girth length in their associated Tanner graphs) are well investigated, estimating their minimum distance is still an open problem. By obtaining sparse generator matrices for several families of these codes, we prove that they are also Quasi-Cyclic Low-Density Generator Matrix codes, which is an important feature to reduce the encoding complexity, and provides a useful tool for the investigation of their minimum distance.
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.
