Abstract

A cylinder-type block-circulant (CTBC) code with circulant permutation matrix (CPM) size p is presented by a binary base matrix with a cylindrical structure and a slope-vector on Zp. The slope-vector is called proper if the corresponding CTBC code is 4-cycle free. In this paper, an algorithm is presented that for a given base matrix with a cylindrical structure, explicitly generates a proper slope-vector. This proper slope-vector provides a lower-bound on the CPM-sizes of the corresponding CTBC codes required to achieve girth at least 6. Interestingly, the lower bound, minimum distance and 6-cycle multiplicity of the constructed CTBC codes are better than some masked and unmasked known explicitly constructed 4-cycle free QC LDPC codes with the same regularity. Simulation results show that the constructed CTBC codes outperform some 4-cycle free QC LDPC codes in binary and nonbinary cases.

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.