Constant-Factor Hardness of Lattice Covering and Statistical Sample-Size Exponents

This preprint studies the complexity of approximating lattice covering radii and the sample requirements for estimating collision probabilities under strong noise. The two cosets of D8 in E8 yield an exact identity relating the squared Euclidean covering radius to the Hamming covering radius of a binary linear code. A quotient construction proves constant-factor hardness for each fixed rational finite p at least one and for power-sum metrics below one. For distributions supported on prescribed lattice cosets, the critical Fourier band gives the exact high-noise sample-size exponent under Gaussian and symmetric stable noise. The paper computes the critical band explicitly in one dimension, separates dual-lattice covering from integer generation when the origin is unknown, and gives hardness results for sparse and fixed Gaussian correlations.

Authors

Publication Details

Journal
Figshare
Published
2026-11-16
DOI
https://doi.org/10.6084/m9.figshare.35031592
Primary Topic
Complexity and Algorithms in Graphs
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Constant-Factor Hardness of Lattice Covering and Statistical Sample-Size Exponents

Akihiro Koide
Figshare
Complexity and Algorithms in Graphs
preprint

Constant-Factor Hardness of Lattice Covering and Statistical Sample-Size Exponents

Akihiro Koide
preprint en

Abstract

This preprint studies the complexity of approximating lattice covering radii and the sample requirements for estimating collision probabilities under strong noise. The two cosets of D8 in E8 yield an exact identity relating the squared Euclidean covering radius to the Hamming covering radius of a binary linear code. A quotient construction proves constant-factor hardness for each fixed rational finite p at least one and for power-sum metrics below one. For distributions supported on prescribed lattice cosets, the critical Fourier band gives the exact high-noise sample-size exponent under Gaussian and symmetric stable noise. The paper computes the critical band explicitly in one dimension, separates dual-lattice covering from integer generation when the origin is unknown, and gives hardness results for sparse and fixed Gaussian correlations.

Figshare
Complexity and Algorithms in Graphs
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon