arXiv (OAI Expanded)
open access
Linear Programming Bounds for Locally Recovery Codes II
We give a polynomial-size linear programming bound for $q$-ary all-symbol locally recoverable codes with locality parameters $(r,δ)$, without assuming linearity. The key idea is to keep, for every ordered pair of codewords and every selected recovery view, the joint Hamming weight on the helper set,
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
- Multi-View Block Distance Distributions and Linear Programming Bounds for Locally Recoverable Codes with Availability#1144197
- Practical Source Code Recovery from Binary Functions Using Anchor-Based Retrieval and LLM Reasoning#361503
- Bounds on Codes Correcting Adjacent Transpositions#609817
- Lossy Compression via Sparse Regression Codes: Generalized Construction and Finite-length Bounds#609655
- Replica Thresholds for Stripeless Erasure Coding Based on Symmetric Block Designs#1077078
Record · ID 1110437
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