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

Journal of Electronics (China)

A novel construction of quantum ldpc codes based on cyclic classes of lines in euclidean geometries

Dong Cao, Yaoliang Song, Shengmei Zhao

Published Mar 1, 2012• 3 citations
Publisher
DOI
10.1007/s11767-012-0817-8

Related papers

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•2 citations

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

Yuanhua Liu, Meiling Zhang, Jiulun Fan

中国邮电高校学报:英文版•Apr 1, 2012•3 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

A Novel Construction of Quantum LDPC Codes Based on Balanced Incomplete Block Designs

Shengmei Zhao, Xiu-Li Zhu, Xiao Ping Yu

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•Feb 28, 2011•3 citations

Random Construction of Quantum LDPC Codes

Koki Okada, Kouki OKADA, Kenta Kasai

•Jan 1, 2025•0 citations

Design of Quasi-Cyclic LDPC Codes Based on Euclidean Geometries

Yuanhua Liu, Xinmei Wang, Jianhua Ma

This paper presents an algebraic method for constructing quasi-cyclic (QC) low-density parity-check (LDPC) codes based on the structural properties of Euclidean geometries. The construction method results in a class of QC-LDPC codes with girth of at least 6. Codes in this class perform very close to the Shannon limit with iterative decoding. Simulations show that the designed QC-LDPC codes have almost the same performance with the existing QC Euclidean geometry LDPC codes.

International Conference on Advanced Information Networking and Applications (AINA)•Jan 1, 2009•7 citations
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.