arXiv (All)
open access
Proximity Gaps for Gabidulin Codes and Applications
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}=
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- : A geometric structural framework for prime number gaps and their Riemann connection#173390
- Asymptotic separation of periodic orbits and fractal dimension#1110662
- On spectral gap decomposition for Markov chains#999155
- Complex Matching Distance and Stability for Minimal Projective Resolutions, with Applications to Persistence#798776
- Complex Matching Distance and Stability for Minimal Projective Resolutions, with Applications to Persistence#797362
Record · ID 996656
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive