works on
computational complexity 1ldpc codes 1minimum distance 1np-completeness 1parameterized complexity 1regular Tanner graphs 1

From the 1 of 9 linked papers with an AI index.

activity
20242026
collaborators
Showing cs.CCShow all

1 paper · 1 filter

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…