← 研踪 PaperTrailarXiv:2611.22617 · v1
Hardness and Inapproximability of the Covering Radius for LDPC Codes
首次提交 2026-11-17 19:34
版本更新 2026-11-17 19:34
雷达观测 2026-11-18 11:33
摘要
Given a binary parity-check matrix and an integer , the covering-radius decision problem asks whether every attainable syndrome can be represented by an error vector of Hamming weight at most . 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 -complete for matrices with maximum row and column weight three, and remains -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.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-17 19:34 · 最新观测版本
Hardness and Inapproximability of the Covering Radius for LDPC Codes
Given a binary parity-check matrix and an integer , the covering-radius decision problem asks whether every attainable syndrome can be represented by an error vector of Hamming weight at most . 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 -complete for matrices with maximum row and column weight three, and remains -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.
查看此版本解读 →查看此版本原文 ↗