Work

The Minimum Subpacketization of Reed-Solomon Codes with Linear Repair Achieving the Cut-Set Bound

Year: 2026

Type: preprint

Abstract: 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

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.37522

Authors: Fang, Weijun, Qiu, Jing, Xia, Shu-Tao, Fu, Fang-Wei

Institution: Shandong University

Language: English

Topic: Advanced Data Storage Technologies

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Natural Science Foundation of China, China Postdoctoral Science Foundation, Nankai University, Nankai Zhide Foundation, National Key Research and Development Program of China, Fundamental Research Funds for the Central Universities

Awards: G3195131139, G5449715320, G824329526, G8377584638, G8461867122, G8759270399, G8890425352

OpenAlex ID: W7224135243

Cites:

Cited by:

Related to: 10