Exact Storage-Repair-Bandwidth Tradeoffs for $(6,5,5)$ and $(7,6,6)$ Exact-Repair Regenerating Codes
Overview & Synopsis
This note provides exact information-theoretic outer bounds that completely characterize the storage-repair-bandwidth tradeoff regions for the cases $(n,k,d)=(6,5,5)$ and $(7,6,6)$. The layered code proposed by Tian et al. achieves the tradeoff and is thus optimal. GPT-6 Astra assisted in the discovery of these bounds, based on a new conditioning argument and a structured search over the restricted subsets of entropy linear program constraints. The proofs are given as exact integer-valued certificates, which are difficult for direct human verification, and a Python verifier is included as part of the package, together with the certificates.
Indexed from repository: arXiv
(
arxiv.org)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Exact Storage-Repair-Bandwidth Tradeoffs for $(6,5,5)$ and $(7,6,6)$ Exact-Repair Regenerating Codes |
|---|---|
| Author / Organization | Chao Tian |
| Subject & Discipline | cs.IT |
| Categories | Science & Mathematics |
| Publication Year | 2026 |
| License / Rights | arXiv Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
arXiv
(arxiv.org)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-269946 |
| Original Source Link | Visit Source Page on arxiv.org » |