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

IEEE International Conference on Communication Systems (ICCS)

Construction of QC-LDPC codes based on generalized RS codes with girth larger than 6

Rong Xia Sun, Yu Min Tian, Jingwei Liu

Published Dec 1, 2016• 8 citations
Publisher

Abstract

In this paper, an approach for constructing Quasi-cyclic(QC)-LDPC codes with girth larger than 6 based on Generalized Reed-Solomon(GRS) codes is presented. The proposed construction method in conjunction with masking, results in codes whose Tanner graphs have girth 8 or even larger. Experimental results show that, with iterative decoding algorithms, the constructed QC-LDPC codes perform well.

DOI
10.1109/iccs.2016.7833579

Related papers

Girth-Eight Reed-Solomon Based QC-LDPC Codes

Xin Wei Xiao, Bane V. Vasic, Shu Lin +2 more

This paper presents a class of regular quasi-cyclic (QC) LDPC codes whose Tanner graphs have girth at least eight. These codes are constructed based on the conventional parity-check matrices of Reed-Solomon (RS) codes with minimum distance 5. Masking their parity-check matrices significantly reduces the numbers of short cycles in their Tanner graphs and results in codes which perform well over the AWGN channel in both waterfall and low error-rate regions.

International Symposium on Turbo Codes and Iterative Information Processing•Dec 1, 2018•2 citations

Reed-Solomon-Based Quasi-Cyclic LDPC Codes: Designs, Cycle Structure and Erasure Correction

Xin Wei Xiao, W.E. Ryan, Bane V. Vasic +2 more

This paper presents some new results on QC-LDPC codes constructed based on Reed-Solomon (RS) codes. Results include designs and constructions of RS-based QC-LDPC codes with girth 8, cycle structure in their Tanner graphs, and correction of erasures.

Information Theory and Applications Workshop (ITA)•Feb 1, 2018•15 citations

Reed-Solomon Based Quasi-Cyclic LDPC Codes: Designs, Girth, Cycle Structure, and Reduction of Short Cycles

Xin Wei Xiao, Bane V. Vasic, Shu Lin +2 more

Designs and constructions of quasi-cyclic (QC) LDPC codes for the AWGN channel are presented. The codes are constructed based on the conventional parity-check matrices of Reed-Solomon (RS) codes and are referred to as RS-QC-LDPC codes. Several classes of RS-QC-LDPC codes are given. Cycle structural properties of the Tanner graphs of codes in these classes are analyzed and specific methods for constructing codes with girth at least eight and reducing their short cycles are presented. The designed codes perform well in both waterfall and low error-rate regions.

IEEE Transactions on Communications•May 14, 2019•18 citations

Construction of Reed-Solomon Based Quasi-Cyclic LDPC Codes Based on Protograph

Inseon Kim, Hong‐Yeop Song

In this paper, we propose construction of Reed-Solomon(RS) based Quasi-Cyclic Low-Density Parity-Check(QC-LDPC) codes using protograph combining two existing QC-LDPC codes construction. One is the construction RS based QC-LDPC codes whose girth is at least 8 and another is protograph based QC-LDPC codes to increase the upper bounds of minimum Hamming distance. We construct the protographs to increase the upper bound of minimum Hamming distance for Proto-RS-QC-LDPC codes and simulate some experiment to show coding gain in sense of BER compare to existing QC-LDPC codes.

Asia-Pacific Conference on Communications (APCC)•Nov 1, 2018•3 citations

Performance of Reed-Solomon Based Quasi-Cyclic LDPC Codes Based on Protograph

Inseon Kim, Hong‐Yeop Song

In this paper, we exploit construction of Reed-Solomon (RS) based Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes using protograph combining two existing QC-LDPC codes construction and experiment the performance of the codes. Two constructions have benefits: One is the construction RS based QC-LDPC codes whose girth is at least 8 and another is protograph based QC-LDPC codes to increase the upper bounds of minimum Hamming distance. We construct the protographs with three strategies and two of them have coding gain in sense of bit error rate compare to existing Reed Solomon based QC-LDPC codes.

International Conference on Information and Communication Technology Convergence (ICTC)•Oct 1, 2018•0 citations

Tanner $(J,L)$ Quasi-Cyclic LDPC Codes: Girth Analysis and Derived Codes

Hengzhou Xu, Huaan Li, Baoming Bai +2 more

Girth plays an important role in the design of low-density parity-check (LDPC) codes. Motivated by the works on the girth of some classes of Tanner quasi-cyclic (QC) LDPC codes, e.g., Tanner (3, 5), (3, 7), (3, 11), and (5, 7) codes, we, in this paper, study the girth of Tanner$(J,L)$QC-LDPC codes where$J$and$L$can be any two positive integers. According to the sufficient and necessary conditions for the existence of cycles of lengths 4, 6, 8, and 10, we propose an algorithm to determine the girth of Tanner$(J,L)$QC-LDPC codes with finite code lengths. Through the analysis of the obtained girth values, we generalize the laws of the girth distributions of Tanner$(J,L)$QC-LDPC codes. Furthermore, based on the exponent matrices of Tanner$(J,L)$QC-LDPC codes with known girths, we employ the column selection method and/or the masking technique to construct binary/nonbinary LDPC codes. The numerical results show that the constructed LDPC codes have good performance under iterative decoding over the additive white Gaussian noise channel.

IEEE Access•Dec 10, 2018•21 citations
In this paper, an approach for constructing Quasi-cyclic(QC)-LDPC codes with girth larger than 6 based on Generalized Reed-Solomon(GRS) codes is presented. The proposed construction method in conjunction with masking, results in codes whose Tanner graphs have girth 8 or even larger. Experimental results show that, with iterative decoding algorithms, the constructed QC-LDPC codes perform well.
Designs and constructions of quasi-cyclic (QC) LDPC codes for the AWGN channel are presented. The codes are constructed based on the conventional parity-check matrices of Reed-Solomon (RS) codes and are referred to as RS-QC-LDPC codes. Several classes of RS-QC-LDPC codes are given. Cycle structural properties of the Tanner graphs of codes in these classes are analyzed and specific methods for constructing codes with girth at least eight and reducing their short cycles are presented. The designed codes perform well in both waterfall and low error-rate regions.
In this paper, we propose construction of Reed-Solomon(RS) based Quasi-Cyclic Low-Density Parity-Check(QC-LDPC) codes using protograph combining two existing QC-LDPC codes construction. One is the construction RS based QC-LDPC codes whose girth is at least 8 and another is protograph based QC-LDPC codes to increase the upper bounds of minimum Hamming distance. We construct the protographs to increase the upper bound of minimum Hamming distance for Proto-RS-QC-LDPC codes and simulate some experiment to show coding gain in sense of BER compare to existing QC-LDPC codes.
In this paper, we exploit construction of Reed-Solomon (RS) based Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes using protograph combining two existing QC-LDPC codes construction and experiment the performance of the codes. Two constructions have benefits: One is the construction RS based QC-LDPC codes whose girth is at least 8 and another is protograph based QC-LDPC codes to increase the upper bounds of minimum Hamming distance. We construct the protographs with three strategies and two of them have coding gain in sense of bit error rate compare to existing Reed Solomon based QC-LDPC codes.
Tanner (J,L)(J,L)(J,L) Quasi-Cyclic LDPC Codes: Girth Analysis and Derived Codes
Girth plays an important role in the design of low-density parity-check (LDPC) codes. Motivated by the works on the girth of some classes of Tanner quasi-cyclic (QC) LDPC codes, e.g., Tanner (3, 5), (3, 7), (3, 11), and (5, 7) codes, we, in this paper, study the girth of Tanner(J,L)(J,L)(J,L)QC-LDPC codes whereJJJandLLLcan be any two positive integers. According to the sufficient and necessary conditions for the existence of cycles of lengths 4, 6, 8, and 10, we propose an algorithm to determine the girth of Tanner(J,L)(J,L)(J,L)QC-LDPC codes with finite code lengths. Through the analysis of the obtained girth values, we generalize the laws of the girth distributions of Tanner(J,L)(J,L)(J,L)QC-LDPC codes. Furthermore, based on the exponent matrices of Tanner(J,L)(J,L)(J,L)QC-LDPC codes with known girths, we employ the column selection method and/or the masking technique to construct binary/nonbinary LDPC codes. The numerical results show that the constructed LDPC codes have good performance under iterative decoding over the additive white Gaussian noise channel.