arXiv (OAI Expanded)
open access
Improved Subexponential Upper Bounds for $3$-Restricted Matching Vector Families
Matching Vector families (MVFs) are defined by two ordered lists of vectors in $\mathbb{Z}_m^n$ whose inner products satisfy specific residue patterns modulo an integer $m$. Most famously, restricted MVFs are used to construct the best-known constant-query Locally Decodable codes (LDCs). We prove
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
- Improved Subexponential Upper Bounds for $3$-Restricted Matching Vector Families#781144
- Integer programming on domains containing inseparable ordered pairs#658859
- codes_Extraction#253901
- CVP Is NP-Complete for Principal Cyclotomic Ideals#1035598
- Divisibility of Trace Codes#924573
Record · ID 779769
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