activity
20242026
most citedOn the Performance of Low-complexity Decoders of LDPC Codes

1 citations · 1 across the 7 of their papers we have counts for

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 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…