Repairing Reed-Solomon Codes via Subspace Polynomials

TL;DR

This paper introduces new repair schemes for Reed-Solomon codes using subspace polynomials, achieving optimal repair bandwidths under specific conditions, thus generalizing previous trace polynomial methods.

Contribution

The paper presents a novel repair scheme for Reed-Solomon codes based on subspace polynomials, extending prior trace polynomial approaches and achieving optimal bandwidth in certain cases.

Findings

Optimal repair bandwidth for single erasure when n=q^l and r=q^m.

Same bandwidth per erasure for two erasures under specific parameter conditions.

Generalization of previous repair schemes using subspace polynomials.

Abstract

We propose new repair schemes for Reed-Solomon codes that use subspace polynomials and hence generalize previous works in the literature that employ trace polynomials. The Reed-Solomon codes are over $\mathbb{F}_{q^\ell}$ and have redundancy $r = n-k \geq q^m$, $1\leq m\leq \ell$, where $n$ and $k$ are the code length and dimension, respectively. In particular, for one erasure, we show that our schemes can achieve optimal repair bandwidths whenever $n=q^\ell$ and $r = q^m,$ for all $1 \leq m \leq \ell$. For two erasures, our schemes use the same bandwidth per erasure as the single erasure schemes, for $\ell/m$ is a power of $q$, and for $\ell=q^a$, $m=q^b-1>1$ ($a \geq b \geq 1$), and for $m\geq \ell/2$ when $\ell$ is even and $q$ is a power of two.