跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv: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
arXiv ↗PDF ↗

摘要

Given a binary parity-check matrix HH and an integer rr, the covering-radius decision problem asks whether every attainable syndrome can be represented by an error vector of Hamming weight at most rr. 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 Π2PΠ_2^{\mathrm P}-complete for matrices with maximum row and column weight three, and remains Π2PΠ_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.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-17 19:34 · 最新观测版本

Hardness and Inapproximability of the Covering Radius for LDPC Codes

Given a binary parity-check matrix HH and an integer rr, the covering-radius decision problem asks whether every attainable syndrome can be represented by an error vector of Hamming weight at most rr. 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 Π2PΠ_2^{\mathrm P}-complete for matrices with maximum row and column weight three, and remains Π2PΠ_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.

查看此版本解读 →查看此版本原文 ↗