Proceedings of the
The Nineteenth International Conference on Computational Intelligence and Security (CIS 2023)
December 1 – 4, 2023, Haikou, China

Design of Masking Matrices for Tanner (5,11)-Regular QC-LDPC Codes

Hengzhou Xu1,a, Mengmeng Xu1,b, Jian Wang1,c, Zhongyang Yu1,d, Huaan Li2 and Hai Zhu1,e

1School of Computer, Henan University of Engineering, China.

2School of Physics and Telecommunication Engineering, Zhoukou Normal University, China.

ABSTRACT

Tanner proposed a class of well-known quasi-cyclic LDPC (QC-LDPC) codes, called Tanner QC-LDPC codes. The research shows that Tanner QC-LDPC codes have good girth distribution. In this paper, we study a class of Tanner QC-LDPC codes, i.e., Tanner (5,11)-regular QC-LDPC codes. By analyzing the cycle structure of Tanner (5,11)-regular QC-LDPC codes, we replace some circulant permutation matrices (CPMs) in their parity-check matrices with zero matrices (ZMs) of the same size, and propose an algorithm for designing the masking matrix. We employ the designed matrix to mask the exponent matrices of Tanner (5,11)-regular QC-LDPC codes, and construct a new class of QC-LDPC codes. Numerical results show that the constructed QC-LDPC codes have good performance under iterative decoding.

Keywords: LDPC code, Quasi-Cyclic (QC), Girth, Prime field.



Download PDF