AI & ML
Hardness and Inapproximability of the Covering Radius for LDPC Codes
arXiv math.IT0 views
arXiv:2611.22617v1 Announce Type: new 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 $\Pi_2^{\mathrm P}$-complete for matrices with maximum row and column weight three, and remains $\Pi_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.
Source:https://arxiv.org/abs/2611.22617PreviousConstructions of reversible linear and DNA codes through $T_{D,g}^n-$set and $(n_1,c_1|n_2,c_2)-$right polycyclic codesNextEntropy maximization for cube projections
Related posts

NVIDIA's CEO Shake-Up Exposes a Costly Prediction Market Deadline
0HackerNoon
Lumi-4B AI Model: Everything You Need to Know
0HackerNoon
The End of the Mouse: How AI Could Change the Way We Use Computers
0HackerNoon
How to Structure AI Adoption Teams and Measure Software Delivery Improvements
0HackerNoon
A Seven-Slide Framework for Funding AI Transformation Without New Headcount
0HackerNoon
System One Models and the Future of AI Decision-Making
0HackerNoon