computational complexity 1ldpc codes 1minimum distance 1np-completeness 1parameterized complexity 1regular Tanner graphs 1
From the 1 of 2 linked papers with an AI index.
2 papers
cs.CC2026
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…
cs.IT2025
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…