Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Communications in computer and information science

Quasi-Cyclic LDPC Codes Constructed Based on Row-Column Constrained Matrices

Hengzhou Xu, Baoming Bai, Hai Jiang Zhu, Mengmeng Xu, Bo Zhang

Published Jan 1, 2018• 1 citation
Publisher
DOI
10.1007/978-981-10-7877-4_27

Related papers

Constructing Quasi-Cyclic LDPC codes Using a Search Algorithm

Gabofetswe Malema

This article presents a search algorithm for constructing regular and irregular quasi-cyclic LDPC codes. Code rows and columns are divided into j (column weight) and k (row-weight) or more groups respectively. Rows or columns in a group are connected to the same group and in order of appearance. Grouping of rows and columns forms sub-matrices. The sequential row-column connections order creates a cyclic structure in sub-matrices. The row-column constraint is observed to avoid four-cycles. The proposed algorithm is flexible compared to other methods. It obtains codes over a wide range of girths, rates and lengths. Bit-error rate simulations show that obtained codes have good performance with randomly searched codes performing better that sequentially searched codes.

IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)•Dec 1, 2007•3 citations

Construction of Quasi-Cyclic LDPC Codes with Diagonal Structure of Parity-Check Matrices

Hengzhou Xu, Huaan Li, Min Zhu +2 more

Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering•Jan 1, 2018•2 citations

Construction of High-Rate Regular Quasi-Cyclic LDPC Codes Based on Cyclic Difference Families

Hosung Park, Seokbeom Hong, Jong‐Seon No +1 more

For a high-rate case, it is difficult to randomly construct good low-density parity-check (LDPC) codes of short and moderate lengths because their Tanner graphs are prone to have short cycles. Also, the existing high-rate quasi-cyclic (QC) LDPC codes can be constructed only for very restricted code parameters. In this paper, based on special classes of cyclic difference families, we propose a new construction method of high-rate regular QC LDPC codes having parity-check matrices consisting of a single row of circulants with column-weight 3 or 4. The proposed QC LDPC codes can be constructed for various code rates and lengths including the minimum achievable length for given column-weight and design rate under girth 6. It is observed that the parity-check matrices of the proposed QC LDPC codes have full rank for column-weight 3 and just one redundant row for column-weight 4. It is shown that the error correcting performance of the proposed QC LDPC codes of short and moderate lengths is almost the same as that of the existing ones through numerical analysis.

arXiv:1211.3828•IEEE Transactions on Communications•Jul 16, 2013•33 citations

Construction of good quasi-cyclic LDPC codes

Xiao Xiao, Lee

•Jan 1, 2006•15 citations

Construction and performance analysis of diagonally shifted column structured RPM based regular quasi cyclic-LDPC codes with girth 10

Jitendra Pratap Singh Mathur, Alpana Pandey

In this manuscript, QC-LDPC (Quasi Cyclic Low-Density Parity Check Codes) are constructed by the diagonally Shifted Column structured Random Permutation Method (RPM) with girth 10. In this proposed method, Random Permutation based Parity Check Matrix, Base Matrix and Zero Matrices has been constructed with a column structured approach using Lower Upper decomposition technique. The row-column mapping Technique is applied to create the sparse behavior of Regular RPM based Quasi Cyclic LDPC Codes. The construction of code is obtainable by means of column weight three and row weight six. Those codes are decoded with Log Domain Sum Product Algorithm. The constructed Sparse Regular RPM-QC-LDPC Codes have low error performance and compared with other existing results.

International Journal of Engineering & Technology•Oct 14, 2018•0 citations

Quasi-cyclic LDPC codes using overlapping matrices and their layered decoders

Beomkyu Shin, Hosung Park, Seokbeom Hong +2 more

AEU - International Journal of Electronics and Communications•Nov 12, 2013•6 citations
This article presents a search algorithm for constructing regular and irregular quasi-cyclic LDPC codes. Code rows and columns are divided into j (column weight) and k (row-weight) or more groups respectively. Rows or columns in a group are connected to the same group and in order of appearance. Grouping of rows and columns forms sub-matrices. The sequential row-column connections order creates a cyclic structure in sub-matrices. The row-column constraint is observed to avoid four-cycles. The proposed algorithm is flexible compared to other methods. It obtains codes over a wide range of girths, rates and lengths. Bit-error rate simulations show that obtained codes have good performance with randomly searched codes performing better that sequentially searched codes.
For a high-rate case, it is difficult to randomly construct good low-density parity-check (LDPC) codes of short and moderate lengths because their Tanner graphs are prone to have short cycles. Also, the existing high-rate quasi-cyclic (QC) LDPC codes can be constructed only for very restricted code parameters. In this paper, based on special classes of cyclic difference families, we propose a new construction method of high-rate regular QC LDPC codes having parity-check matrices consisting of a single row of circulants with column-weight 3 or 4. The proposed QC LDPC codes can be constructed for various code rates and lengths including the minimum achievable length for given column-weight and design rate under girth 6. It is observed that the parity-check matrices of the proposed QC LDPC codes have full rank for column-weight 3 and just one redundant row for column-weight 4. It is shown that the error correcting performance of the proposed QC LDPC codes of short and moderate lengths is almost the same as that of the existing ones through numerical analysis.
In this manuscript, QC-LDPC (Quasi Cyclic Low-Density Parity Check Codes) are constructed by the diagonally Shifted Column structured Random Permutation Method (RPM) with girth 10. In this proposed method, Random Permutation based Parity Check Matrix, Base Matrix and Zero Matrices has been constructed with a column structured approach using Lower Upper decomposition technique. The row-column mapping Technique is applied to create the sparse behavior of Regular RPM based Quasi Cyclic LDPC Codes. The construction of code is obtainable by means of column weight three and row weight six. Those codes are decoded with Log Domain Sum Product Algorithm. The constructed Sparse Regular RPM-QC-LDPC Codes have low error performance and compared with other existing results.