arXiv · 2611.22617
Hardness and Inapproximability of the Covering Radius for LDPC Codes
Abstract
Given a binary parity-check matrix $H$ and an integer $r$, the covering-radius decision problem asks whether every attainable syndrome can be represented by an error vector of Hamming weight at most $r$. We study this problem for sparse parity-check matrices with bounded row and column weights. Using a bounded-occurrence quantified-SAT reduction, we prove that the problem is $Π_2^{\mathrm P}$-complete for matrices with maximum row and column weight three, and remains $Π_2^{\mathrm P}$-hard under a constant multiplicative gap. Starting from Vertex Cover on 3-regular graphs, we also obtain an explicit NP-hard approximation factor under the same weight constraints. We remark that weight three is the exact threshold for hardness: if either the maximum row weight or the maximum column weight is at most two, the covering radius can be computed in polynomial time.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Massimo Battaglioni, Fabrizio Marinelli. 2026-11-17. Hardness and Inapproximability of the Covering Radius for LDPC Codes. https://searcharxiv.com/abs/2611.22617
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.