Reproduce “Exact Storage-Repair-Bandwidth Tradeoffs for $(6,5,5)$ and $(7,6,6)$ Exact-Repair Regenerating Codes” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Chao Tian
The authors characterize exact-repair tradeoffs for (6,5,5) and (7,6,6), without assuming linear codes. They condition on incoming repair messages to reduce each proof to a smaller repair system and certify bounds with integer identities. For n=6, the inequality 6α+5β≥2B excludes a point allowed by the prior bound; layered codes with space sharing attain the regions in these two cases.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.