arXiv (All)
open access
Multi-View Block Distance Distributions and Linear Programming Bounds for Locally Recoverable Codes with Availability
We develop a multi-view linear-programming framework for locally recoverable codes with arbitrary fixed availability $a$. For any retained order $1 \le s \le a$, the selected helper sets, the recovered coordinate, and their complement form an $(s+2)$-part partition. Recording the Hamming distance on
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
- Linear Programming Bounds for Locally Recovery Codes II#1110437
- CodeRescue: Budget-Calibrated Recovery Routing for Coding Agents#386901
- Bounds on Codes Correcting Adjacent Transpositions#609817
- CRVS robustness - Replication code and datasets#12165
- CRVS robustness - Replication code and datasets#12164
Record · ID 1144197
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