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

中国邮电高校学报:英文版

Quasi-cyclic LDPC codes with high-rate and low error floor based on Euclidean geometries

Yuanhua Liu, Meiling Zhang, Jiulun Fan

Published Apr 1, 2012• 3 citations
Publisher
DOI
10.1016/s1005-8885(11)60252-5

Related papers

Multiple-Rate Quasi-Cyclic LDPC Codes Based on Euclidean Geometries

Xueqin Jiang, Moon Ho Lee, Tae Chol Shin

This letter presents an approach to the construction of multiple-rate quasi-cyclic (QC) low-density parity-check (LDPC) codes based on hyperplanes (μ-flats) of two different dimensions in Euclidean geometries. The codes constructed with this method have the same code length, multiple-rate and large stopping sets while maintaining the same basic hardware architecture. The code performance is investigated in terms of the bit error rate (BER) and compared with those of the LDPC codes which are proposed in IEEE 802.16e standard. Simulation results show that our codes perform very well and have low error floors over the AWGN channel.

IEICE Transactions on Communications•Jan 1, 2010•0 citations

Design of Quasi-Cyclic LDPC codes based on Euclidean Geometries

Yuanhua Liu, Xinliang Niu, Xinmei Wang +1 more

Journal of Electronics (China)•May 1, 2010•1 citation

Quasi-cyclic LDPC codes with high-rate and low error floor based on Euclidean geometries

LIUYluan-hua, ZHANGMei-ling, FANJiu-lun

设计的一条改进欧几里德几何学的几何学途径伪周期(质量管理) 有高率、低的错误地板的低密度的同等值检查(LDPC ) 代码被论述。构造 QC-LDPC 代码与高率比原来的代码有更低的错误地板。最小的重量 codeword 的分发被分析,并且最小的重量 codeword 的一个足够的存在条件被发现。很多 QC-LDPC 与更低的错误地板编码的模拟表演能被减少最小的重量 codewords 的数字设计令人满意这个足够的条件。

中国邮电高校学报:英文版•Jan 1, 2012•0 citations

DESIGN OF QUASI-CYCLIC LDPC CODES BASED ON EUCLIDEAN GEOMETRIES

Liu, Yuanhua, Niu +5 more

Journal of Electronics (China)•Jan 1, 2010•1 citation

Construction of good quasi-cyclic LDPC codes

Xiao Xiao, Lee

•Jan 1, 2006•16 citations

Construction of quasi-cyclic LDPC codes based on euclidean geometries

Yuanhua Liu, Meiling Zhang

A new method for constructing quasi-cyclic (QC) low-density parity-check (LDPC) codes based on the structural properties of Euclidean geometries is presented. The proposed method changes the incidence vectors of some lines in the original Euclidean geometry method to construct much more parity check matrices and results in a large class of QC-LDPC codes with girth of at least 6. Simulations show that some codes in this class have better performance and lower error floor than the original Euclidean geometry codes.

International Conference on Communications and Networking in China (ChinaCom)•Aug 1, 2013•1 citation
This letter presents an approach to the construction of multiple-rate quasi-cyclic (QC) low-density parity-check (LDPC) codes based on hyperplanes (μ-flats) of two different dimensions in Euclidean geometries. The codes constructed with this method have the same code length, multiple-rate and large stopping sets while maintaining the same basic hardware architecture. The code performance is investigated in terms of the bit error rate (BER) and compared with those of the LDPC codes which are proposed in IEEE 802.16e standard. Simulation results show that our codes perform very well and have low error floors over the AWGN channel.
设计的一条改进欧几里德几何学的几何学途径伪周期(质量管理) 有高率、低的错误地板的低密度的同等值检查(LDPC ) 代码被论述。构造 QC-LDPC 代码与高率比原来的代码有更低的错误地板。最小的重量 codeword 的分发被分析,并且最小的重量 codeword 的一个足够的存在条件被发现。很多 QC-LDPC 与更低的错误地板编码的模拟表演能被减少最小的重量 codewords 的数字设计令人满意这个足够的条件。
A new method for constructing quasi-cyclic (QC) low-density parity-check (LDPC) codes based on the structural properties of Euclidean geometries is presented. The proposed method changes the incidence vectors of some lines in the original Euclidean geometry method to construct much more parity check matrices and results in a large class of QC-LDPC codes with girth of at least 6. Simulations show that some codes in this class have better performance and lower error floor than the original Euclidean geometry codes.