dorsal/arxiv
View SchemaReducing The Sub-packetization Level of Optimal-Access Cooperative MSR Codes
| Authors | Yaqian Zhang, Jingke Xu |
|---|---|
| Categories | |
| ArXiv ID | 2601.09188vv1 |
| URL | https://arxiv.org/abs/2601.09188 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
Cooperative MSR codes are a kind of storage codes which enable optimal-bandwidth repair of any $h\geq2$ node erasures in a cooperative way, while retaining the minimum storage as an $[n,k]$ MDS code. Each code coordinate (node) is assumed to store an array of $\ell$ symbols, where $\ell$ is termed as sub-packetization. Large sub-packetization tends to induce high complexity, large input/output in practice. To address the disk IO capability, a cooperative MSR code is said to have optimal-access property, if during node repair, the amount of data accessed at each helper node meets a theoretical lower bound. In this paper, we focus on reducing the sub-packetization of optimal-access cooperative MSR codes with two erasures. At first, we design two crucial MDS array codes for repairing a specific repair pattern of two erasures with optimal access. Then, using the two codes as building blocks and by stacking up of the two codes for several times, we obtain an optimal-access cooperative MSR code with two erasures. The derived code has sub-packetization $\ell=r^{\binom{n}{2}-\lfloor\frac{n}{r}\rfloor(\binom{r}{2}-1)}$ where $r=n-k$, and it reduces $\ell$ by a fraction of $1/r^{\lfloor\frac{n}{r}\rfloor(\binom{r}{2}-1)}$ compared with the state of the art ($\ell=r^{\binom{n}{2}}$).
{
"annotation_id": "f2b92838-7b12-4b03-a8fa-9645a1b43d8d",
"date_created": "2026-02-17T05:53:19.853000Z",
"date_modified": "2026-02-17T05:53:19.853000Z",
"file_hash": "147ad94de397f96cfd8750fef5d2625b006db9615155b7fec9540d9b962c20fe",
"private": false,
"record": {
"abstract": "Cooperative MSR codes are a kind of storage codes which enable optimal-bandwidth repair of any $h\\geq2$ node erasures in a cooperative way, while retaining the minimum storage as an $[n,k]$ MDS code. Each code coordinate (node) is assumed to store an array of $\\ell$ symbols, where $\\ell$ is termed as sub-packetization. Large sub-packetization tends to induce high complexity, large input/output in practice. To address the disk IO capability, a cooperative MSR code is said to have optimal-access property, if during node repair, the amount of data accessed at each helper node meets a theoretical lower bound.\n In this paper, we focus on reducing the sub-packetization of optimal-access cooperative MSR codes with two erasures. At first, we design two crucial MDS array codes for repairing a specific repair pattern of two erasures with optimal access. Then, using the two codes as building blocks and by stacking up of the two codes for several times, we obtain an optimal-access cooperative MSR code with two erasures. The derived code has sub-packetization $\\ell=r^{\\binom{n}{2}-\\lfloor\\frac{n}{r}\\rfloor(\\binom{r}{2}-1)}$ where $r=n-k$, and it reduces $\\ell$ by a fraction of $1/r^{\\lfloor\\frac{n}{r}\\rfloor(\\binom{r}{2}-1)}$ compared with the state of the art ($\\ell=r^{\\binom{n}{2}}$).",
"arxiv_id": "2601.09188",
"authors": [
"Yaqian Zhang",
"Jingke Xu"
],
"categories": [
"cs.IT",
"math.IT"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Reducing The Sub-packetization Level of Optimal-Access Cooperative MSR Codes",
"url": "https://arxiv.org/abs/2601.09188",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "40049151-10a6-4e57-bd12-4f319e155f11",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}