The Minimum Subpacketization of Reed-Solomon Codes with Linear Repair Achieving the Cut-Set Bound
In this paper, we study the minimum subpacketization of $(n,k)$ Reed-Solomon (RS) codes over $\mathbb{F}_{q^\ell}$ admitting cut-set-optimal exact $\mathbb{F}_q$-linear repair of every coordinate from any $d$ helpers. For $3\le k
Authors
- Fang-Wei Fu (ORCID: https://orcid.org/0000-0002-9696-8977)
- Weijun Fang (ORCID: https://orcid.org/0000-0003-4121-290X)
- Shu-Tao Xia
- Jing Qiu
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-10-27
- DOI
- https://doi.org/10.48550/arxiv.2610.37522
- Primary Topic
- Advanced Data Storage Technologies
- Type
- preprint