Proximity Gaps for Gabidulin Codes and Applications

• URL: http://arxiv.org/abs/2609.09838v1
• Date: Wed, 09 Sep 2026 07:45:54 GMT
• Title: Proximity Gaps for Gabidulin Codes and Applications
• Abstract summary: We show that every $[n,k,d]$ linear rank-metric code $C$ over $mathbb F_qm$ admits a proximity gap with error $$.<n>For Gabidulin codes, we improve the gap to $(d-1)/(2n)$ with error $10qn-1/qm.<n>These two proximity gaps match those for general linear Hamming-metric codes and Reed-leaved (RS) codes.<n>We then adapt the Ligero-based PCS for ordinarys to obtain a $q$
• Score: 25.766490264515806
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Proximity gaps are central to the soundness of interactive oracle proofs of proximity (IOPPs) and polynomial commitment schemes (PCSs). An $[n,k,d]$ linear code $C\subseteq\mathbb F^n$ has a $δ$-proximity gap with error $ε$ if, for every $u_0,u_1\in\mathbb F^n$, either all points on $\ell_{u_0,u_1}=\{u_0+αu_1:α\in\mathbb F\}$ are $δ$-close to $C$, or at most an $ε$ fraction are. Although proximity gaps for Hamming-metric codes are well understood, their rank-metric counterparts remain largely unexplored despite their applications in coding theory and cryptography. In this work, we study proximity gaps for linear rank-metric codes and their cryptographic applications. First, we show that every $[n,k,d]$ linear rank-metric code $C$ over $\mathbb F_{q^m}$ admits a proximity gap for every $δ\le(d-1)/(3n)$, with error at most $q^{e+1}/q^m$, where $e=\lfloorδn\rfloor$. For Gabidulin codes, we improve the gap to $(d-1)/(2n)$ with error $10q^{n-1}/q^m$. These two proximity gaps match those for general linear Hamming-metric codes and Reed--Solomon (RS) codes, respectively. We prove the $(d-1)/(2n)$ bound is tight by constructing an infinite family of constant-rate Gabidulin codes and affine lines $\ell_{u_0,u_1}$ on which a $1-o(1)$ fraction of points are $d/(2n)$-close to the code, while $u_1$ is at least $3d/(4n)$-far from it. At the $d/(3n)$ gap, we also give a counterexample establishing a lower bound on $ε$. As applications, we construct an IOPP for interleaved Gabidulin codes by adapting the Ligero IOPP for interleaved RS codes. We then adapt the Ligero-based PCS for ordinary polynomials to obtain a $q$-linearized polynomial commitment scheme. To our knowledge, this is the first PCS framework based on rank-metric error-correcting codes.

Related papers

• A Note on Binary Quadratic Systems and their relation to complexity theory [0.0]
  We prove $(FF_2)n$ as the ground set of the evaluation matroid of $Q_d$.<n>We also use a Whitney-type sign-reversing involution to show that only terms that can push $_1/2n$ below $_1/2n$ come from the elements of a matroid port.
  arXiv  Detail & Related papers  (2026-09-07T17:19:05Z)
• Quantum Codes from $r$-Nearly Self-Orthogonal Linear Codes via Jordan Canonical Form over $\mathbb{F}_{q^2}$ [5.6342405886627]
  We introduce a Jordan-canonical-form framework for constructing $q$-ary quantum stabilizer codes from arbitrary classical linear codes over $F_q2$.<n>The framework does not require the classical linear code $mathcalC$ to satisfy the dual-containing condition (i.e., self-orthogonality)<n>Applying this construction to classical codes produces several record quantum codes that improve or supplement the best-known parameters in Grassl's tables.
  arXiv  Detail & Related papers  (2026-07-14T00:58:42Z)
• Generalized Extended Codes with Applications in Entanglement-Assisted Qubit and Qutrit Codes [34.65128303335464]
  We prove that any generalized extended code is monomially equivalent to the Hermitian dual of a code which is closely related to a second kind of extended code of $Cperp_rm H$.<n>We obtain explicit criteria to independently control the expected Hermitian hull dimension and Hermitian dual distance of $C(bf u,a)$.
  arXiv  Detail & Related papers  (2026-07-02T13:41:14Z)
• Discrepancy for Random Linear Codes [10.105438043325357]
  We prove that random linear codes have nearly optimal discrepancy properties in a broad range of regimes.<n>First, random linear codes match unstructured random codes for list-decoding from errors above capacity.<n>Second, over prime fields, random linear codes match unstructured random codes for zero-error list-recovery above capacity.
  arXiv  Detail & Related papers  (2026-06-23T12:01:54Z)
• Information-Computation Tradeoffs for Noiseless Linear Regression with Oblivious Contamination [65.37519531362157]
  We show that any efficient Statistical Query algorithm for this task requires VSTAT complexity at least $tildeOmega(d1/2/alpha2)$.
  arXiv  Detail & Related papers  (2025-10-12T15:42:44Z)
• Learning and Computation of $Φ$-Equilibria at the Frontier of Tractability [85.07238533644636]
  $Phi$-equilibria is a powerful and flexible framework at the heart of online learning and game theory.<n>We show that an efficient online algorithm incurs average $Phi$-regret at most $epsilon$ using $textpoly(d, k)/epsilon2$ rounds.<n>We also show nearly matching lower bounds in the online setting, thereby obtaining for the first time a family of deviations that captures the learnability of $Phi$-regret.
  arXiv  Detail & Related papers  (2025-02-25T19:08:26Z)
• The Communication Complexity of Approximating Matrix Rank [50.6867896228563]
  We show that this problem has randomized communication complexity $Omega(frac1kcdot n2log|mathbbF|)$. As an application, we obtain an $Omega(frac1kcdot n2log|mathbbF|)$ space lower bound for any streaming algorithm with $k$ passes.
  arXiv  Detail & Related papers  (2024-10-26T06:21:42Z)
• Block Circulant Codes with Application to Decentralized Systems [12.014314088945968]
  We develop a family of $[n,k,d]$ block circulant codes that support distributed erasure decoding.<n>The code is ideal for use in protocols that address the data availability problem in blockchain networks.
  arXiv  Detail & Related papers  (2024-06-18T00:22:20Z)
• The Approximate Degree of DNF and CNF Formulas [95.94432031144716]
  For every $delta>0,$ we construct CNF and formulas of size with approximate degree $Omega(n1-delta),$ essentially matching the trivial upper bound of $n. We show that for every $delta>0$, these models require $Omega(n1-delta)$, $Omega(n/4kk2)1-delta$, and $Omega(n/4kk2)1-delta$, respectively.
  arXiv  Detail & Related papers  (2022-09-04T10:01:39Z)
• Low-degree learning and the metric entropy of polynomials [44.99833362998488]
  We prove that any (deterministic or randomized) algorithm which learns $mathscrF_nd$ with $L$-accuracy $varepsilon$ requires at least $Omega(sqrtvarepsilon)2dlog n leq log mathsfM(mathscrF_n,d,|cdot|_L,varepsilon) satisfies the two-sided estimate $$c (1-varepsilon)2dlog
  arXiv  Detail & Related papers  (2022-03-17T23:52:08Z)
• Low-Rank Approximation with $1/\epsilon^{1/3}$ Matrix-Vector Products [58.05771390012827]
  We study iterative methods based on Krylov subspaces for low-rank approximation under any Schatten-$p$ norm. Our main result is an algorithm that uses only $tildeO(k/sqrtepsilon)$ matrix-vector products.
  arXiv  Detail & Related papers  (2022-02-10T16:10:41Z)
• Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case [3.729242965449096]
  We consider streaming algorithms for approximating the value of Unique Games on a hypergraph with $t$-size hyperedges. We show that every streaming algorithm in the adversarial model achieving an $(r-varepsilon)$-approximation of this value requires $Omega(n1-2/t)$ quantum space.
  arXiv  Detail & Related papers  (2021-09-06T16:56:19Z)
• Nearly Horizon-Free Offline Reinforcement Learning [97.36751930393245]
  We revisit offline reinforcement learning on episodic time-homogeneous Markov Decision Processes with $S$ states, $A$ actions and planning horizon $H$. We obtain the first set of nearly $H$-free sample complexity bounds for evaluation and planning using the empirical MDPs.
  arXiv  Detail & Related papers  (2021-03-25T18:52:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.