arXiv (All)
open access
Beyond Polynomials: Optimal Locally Recoverable Codes from Good Rational Functions
Locally recoverable codes (LRCs) play an important role in distributed and cloud storage systems. The celebrated Tamo--Barg construction of optimal LRCs is based on the notion of \emph{good polynomials}. In this paper, we introduce the notion of \emph{good rational functions} as a natural generaliza
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
- Random Algebraic Geometry Codes Approach the Half-Singleton Bound for Insertions and Deletions#974018
- Keyless secrecy against bounded adversaries#1000211
- Projector additive group codes#821838
- Covering radius of rank-metric codes via covering lifts and clubs#1249206
- Optimal Average Success Probabilities of Binary $(n,n-1)$ and $(n,n-2)$ Quantum Random Access Codes#1422908
Record · ID 1422852
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