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

Preparing for a post-quantum future
0TechRadar

75+ best Black Friday deals 2026 in the UK — GTA 6, Kindles, Switch 2, Shark vacuums, LG OLED TVs, and more
0TechRadar

Why no 40fps mode for GTA 6? — Rockstar says the ‘complexity of simulating and rendering our world’ requires it to ‘carefully balance how we spend every millisecond of both the central processor and t
0TechRadar

'Enterprises need to connect AI to the right data': Report finds over half of firms have abandoned AI projects over unclear goals
0TechRadar

$3.26 million in SpaceX AI data center revenue will be pumped back into the City of Memphis
0Tom's Hardware

The Downfall of Jensen Huang — a timeline of allegations and scandals that brought down the king of AI infrastructure
0Tom's Hardware