New Minimum Storage Regenerating Codes With Small Sub-packetization Levels for All Admissible Repair Degrees
Year: 2026
Type: preprint
Abstract: In this paper, {we propose a new family of $(n, k)$ Minimum Storage Regenerating (MSR) codes} for distributed storage systems. By structuring the parity-check matrix as a block Vandermonde matrix composed of diagonal matrices and generalized permutation matrices, the proposed code achieves a sub-packetization level of $N = (d-k+1)^{\lceil\frac{n}{2}\rceil}$ and supports any repair degree $k+1\le d
Source: arXiv (Cornell University)
Authors: Li, Jie, Tang, Xiaohu, Song, Linqi
Institutions: City University of Hong Kong, Southwest Jiaotong University
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7221813264