Reproduce “The Minimum Subpacketization of Reed-Solomon Codes with Linear Repair Achieving the Cut-Set Bound” 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
Weijun Fang, Jing Qiu, Shu-Tao Xia, Fang-Wei Fu
The authors determine the minimum subpacketization for Reed–Solomon codes with exact linear repair at cut-set bandwidth. They relate repair-imposed field-degree constraints to least common multiples of evaluation-point degrees, enabling constructions with shared prime factors. For d(d+2)≥4(n+1), the minimum is sΔ_s(n,d)=sG_s(n), for every prime-power field. Outside this regime, the equality remains unproved, and an affine-plane example disproves universal sG_s(n).
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.