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 INFORMATION TECHNOLOGY

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

Shengmei Zhao, Xiu-Li Zhu, Xiao Ping Yu

Published Feb 28, 2011• 3 citations
Publisher
DOI
10.3724/sp.j.1146.2009.01482

Related papers

Construction of Quasi-Cyclic LDPC Codes Using a Class of Balanced Incomplete Block Designs with Irregular Block Sizes

Hosung Park

Journal of Communications•Jan 1, 2019•5 citations

New Constructions of Quasi-cyclic LDPC Codes Based on Two Classes of Balanced Incomplete Block Designs: For AWGN and Binary Erasure Channels

Lan Lan, Ying Yu Tai, Shu Lin +2 more

Lecture notes in computer science•Jan 1, 2006•0 citations

LDPC Codes on Balanced Incomplete Block Designs: Construction, Girth, and Cycle Structure Analysis

Hengzhou Xu, Xiaodong Zhang, Mengmeng Xu +2 more

In this paper, we investigate the cycle structure inherent in the Tanner graphs of low-density parity-check (LDPC) codes constructed from balanced incomplete block designs (BIBDs). We begin by delineating the incidence structure of BIBDs and propose a methodology for constructing LDPC codes based on these designs. By analyzing the incidence relations between points and blocks within a BIBD, we prove that the resulting LDPC codes possess a girth of 6. Subsequently, we provide a detailed analysis of the cycle structure of the constructed LDPC codes and introduce a systematic approach for enumerating their short cycles. Using this method, we determine the exact numbers of cycles of lengths 6 and 8. Simulation results demonstrate that the constructed LDPC codes exhibit excellent performance.

Entropy•Apr 27, 2025•0 citations

Random Construction of Quantum LDPC Codes

Koki Okada, Kouki OKADA, Kenta Kasai

•Jan 1, 2025•0 citations

Bringing Classical LDPC Design Principles to Quantum LDPC Codes

Kenta Kasai, Kenta Kasai

•May 1, 2026•0 citations

A Rate Scalable Construction of Non-Homogeneous Quantum LDPC Codes of CSS Type Based on Balanced Incomplete Block Design

Yun-Jiang Wang, Zhuo-Yan Xiao, Xing-Yu Xiong +3 more

Balanced incomplete block design (BIBD) offers an important way to construct non-homogeneous quantum low-density-parity-check (LDPC) codes of Calderbank-Shor-Steane (CSS) type. However, the rates of the quantum codes based on this method are limited to be 1-2/m approximately, where m, the number of base blocks chosen from the associated BIBD, is even. We overcome this limitation by providing a rate scalable way to construct non-homogeneous quantum LDPC codes of CSS type. With our method, the rates of the resultant quantum codes are 1-2/m', where m'=m/e and e ∈ {1, 2}. Note that here m' can be odd. Thus, we double the rate range of the codes yielded from the existing strategies. Moreover, one can switch codes between the two rates flexibly adapting to various application scenarios.

IEEE Communications Letters•Feb 25, 2021•4 citations
In this paper, we investigate the cycle structure inherent in the Tanner graphs of low-density parity-check (LDPC) codes constructed from balanced incomplete block designs (BIBDs). We begin by delineating the incidence structure of BIBDs and propose a methodology for constructing LDPC codes based on these designs. By analyzing the incidence relations between points and blocks within a BIBD, we prove that the resulting LDPC codes possess a girth of 6. Subsequently, we provide a detailed analysis of the cycle structure of the constructed LDPC codes and introduce a systematic approach for enumerating their short cycles. Using this method, we determine the exact numbers of cycles of lengths 6 and 8. Simulation results demonstrate that the constructed LDPC codes exhibit excellent performance.
Balanced incomplete block design (BIBD) offers an important way to construct non-homogeneous quantum low-density-parity-check (LDPC) codes of Calderbank-Shor-Steane (CSS) type. However, the rates of the quantum codes based on this method are limited to be 1-2/m approximately, where m, the number of base blocks chosen from the associated BIBD, is even. We overcome this limitation by providing a rate scalable way to construct non-homogeneous quantum LDPC codes of CSS type. With our method, the rates of the resultant quantum codes are 1-2/m', where m'=m/e and e ∈ {1, 2}. Note that here m' can be odd. Thus, we double the rate range of the codes yielded from the existing strategies. Moreover, one can switch codes between the two rates flexibly adapting to various application scenarios.