Repairing Reed-Solomon Codes via Subspace Polynomials

DOI10.1109/TIT.2021.3071878MaRDI QIDQ5032504zbMATH OpenOpenAlexFDO

Authors Son Hoang Dau, Thi Xinh Dinh, Han Mao Kiah, Tran Thi Luong, Olgica Milenkovic

Publication date 17 February 2022

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2007.15253

zbMATH Keywords

Reed-Solomon codes subspace polynomials repair schemes

Mathematics Subject Classification ID

Other types of codes (94B60)

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

m a t h b b F_{q^{e} l l}

and have redundancy

r = n - k g e q q^{m}

,

1 l e q m l e q e l l

, 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^{e} l l

and

r = q^{m},

for all

1 l e q m l e q e l l

. For two erasures, our schemes use the same bandwidth per erasure as the single erasure schemes, for

e l l / m

is a power of

q

, and for

e l l = q^{a}

,

m = q^{b} - 1 > 1

(

a g e q b g e q 1

), and for

m g e q e l l / 2

when

e l l

is even and

q

is a power of two.

Recommendations

Cited in

(4)

This page was built for publication: Repairing Reed-Solomon Codes via Subspace Polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5032504)