9 papers
On the Intractability of the Minimum Distance Problem for Regular LDPC Codes
Chenyuan Jia, Qingqing Peng, Ke Liu +2
The minimum distance problem (MDP) for low-density parity-check (LDPC) codes is a central problem in coding theory and is closely related to the analysis of low-weight codewords an…
Analysis of Efficient Scheduling in Layered Decoding of GLDPC Codes
Qingqing Peng, Dongxu Chang, Guiying Yan +1
In this study, we investigate the characteristics of scheduling sequences that enable efficient decoding of generalized low-density parity-check (GLDPC) codes under the layered mes…
Tackling Over-smoothing on Hypergraphs: A Ricci Flow-guided Neural Diffusion Approach
Mengyao Zhou, Zhiheng Zhou, Xiao Han +3
Hypergraph neural networks (HGNNs) have demonstrated strong capabilities in modeling complex higher-order relationships. However, existing HGNNs often suffer from over-smoothing as…
Linear Complexity Computation of Code Distance and Minimum Size of Trapping Sets for LDPC Codes with Bounded Treewidth
Qingqing Peng, Ke Liu, Guiying Yan +1
It is well known that, given \(b\ge 0\), finding an -trapping set with the minimum \(a\) in a binary linear code is NP-hard. In this paper, we demonstrate that this problem…
On the Convergence Speed of Spatially Coupled LDPC Ensembles Under Window Decoding
Qingqing Peng, Dongxu Chang, Guanghui Wang +1
It is known that windowed decoding (WD) can effectively balance the performance and complexity of spatially coupled low-density parity-check (LDPC) codes. In this study, we show th…
Dynamic Layered Decoding Scheduling for LDPC Codes Aided by Check Node Unsatisfied Probabilities
Chenyuan Jia, Dongxu Chang, Ruiyuan Wang +3
This letter revisits update ordering in layered belief propagation (LBP) decoding of low-density parity-check (LDPC) codes. The closest probability-based schedule orders layers by…
High Throughput QC-LDPC Decoder With Optimized Schedule Policy in Layered Decoding
Dongxu Chang, Qingqing Peng, Guanghui Wang +1
In this study, a scheduling policy of layered decoding for quasi-cycle (QC) low-density parity-check (LDPC) codes with high throughput and good performance is designed. The influen…
The Impact of the Distance Between Cycles on Elementary Trapping Sets
Haoran Xiong, Guanghui Wang, Zhiming Ma +1
Elementary trapping sets (ETSs) are the main culprits of the performance of low-density parity-check (LDPC) codes in the error floor region. Due to their large quantities and compl…
On the lifting degree of girth-8 QC-LDPC codes
Haoran Xiong, Guanghui Wang, Zhiming Ma +1
The lifting degree and the deterministic construction of quasi-cyclic low-density parity-check (QC-LDPC) codes have been extensively studied, with many construction methods in the…