Abstract
This paper presents a technique to decompose a cyclic code given by a parity-check matrix in circulant form into descendant cyclic and quasi-cyclic codes of various length and rates. Based on this technique, cyclic finite geometry (FG) LDPC codes are decomposed into a large class of cyclic FG-LDPC codes and a large class of quasi-cyclic FG-LDPC codes.
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.
