Category Ranking
98%
Total Visits
921
Avg Visit Duration
2 minutes
Citations
20
Article Abstract
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.
Download full-text PDF |
Source |
|---|---|
| http://www.ncbi.nlm.nih.gov/pmc/articles/PMC12110071 | PMC |
| http://dx.doi.org/10.3390/e27050476 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
Adaptive Learned Belief Propagation for Decoding Error-Correcting Codes.
Entropy (Basel)
July 2025
Telecom Paris, Institut Polytechnique de Paris, 91120 Palaiseau, France.
Weighted belief propagation (WBP) for the decoding of linear block codes is considered. In WBP, the Tanner graph of the code is unrolled with respect to the iterations of the belief propagation decoder. Then, weights are assigned to the edges of the resulting recurrent network and optimized offline using a training dataset.
View Article and Find Full Text PDFLayered HARQ Design for LDPC-Based Multi-Level Coded Modulation.
Entropy (Basel)
June 2025
School of Computer and Information Engineering, Shanghai Polytechnic University, Shanghai 201209, China.
Multi-level coded modulation (MLCM) enhances data transmission by allocating error correction more effectively to bits with higher error probabilities, thus optimizing redundancy and improving performance. Despite MLCM's advantages over traditional bit-interleaved coded modulation (BICM) systems in certain scenarios, its integration with hybrid automatic repeat request (HARQ) systems remains underexplored. HARQ, which combines the benefits of forward error correction (FEC) and automatic repeat request (ARQ), significantly increases resilience to interference and fading, enhancing overall system reliability.
View Article and Find Full Text PDFLDPC Codes on Balanced Incomplete Block Designs: Construction, Girth, and Cycle Structure Analysis.
Entropy (Basel)
April 2025
School of Computer, Henan University of Engineering, Zhengzhou 451191, China.
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.
View Article and Find Full Text PDFEnergy Barrier of Hypergraph Product Codes.
Phys Rev Lett
May 2025
University of California, Davis, Department of Computer Science, California 95616, USA.
A macroscopic energy barrier is a necessary condition for self-correcting quantum memory. In this Letter, we prove tight bounds on the energy barrier applicable to any quantum code obtained from the hypergraph product of two classical codes. If the underlying classical codes are low-density parity-check codes (LDPC), the energy barrier of the quantum code is shown to be the minimum energy barrier of the underlying classical codes (and their transposes) up to an additive O(1) constant.
View Article and Find Full Text PDFLow-Density Parity-Check Decoding Algorithm Based on Symmetric Alternating Direction Method of Multipliers.
Entropy (Basel)
April 2025
School of Computer, Henan University of Engineering, Zhengzhou 451191, China.
The Alternating Direction Method of Multipliers (ADMM) has proven to be an efficient approach for implementing linear programming (LP) decoding of low-density parity-check (LDPC) codes. By introducing penalty terms into the LP decoding model's objective function, ADMM-based variable node penalized decoding effectively mitigates non-integral solutions, thereby improving frame error rate (FER) performance, especially in the low signal-to-noise ratio (SNR) region. In this paper, we leverage the ADMM framework to derive explicit iterative steps for solving the LP decoding problem for LDPC codes with penalty functions.
View Article and Find Full Text PDF