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…