From the 1 of 9 linked papers with an AI index.
9 papers
On the Intractability of the Minimum Distance Problem for Regular LDPC Codes
Chenyuan Jia, Qingqing Peng, Ke Liu +2
The paper investigates the computational difficulty of determining the minimum distance of regular LDPC codes, proving NP‑completeness and W[1]‑completeness for various left‑regula…
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…