Repairing Reed-Solomon Codes via Subspace Polynomials

DOI10.1109/TIT.2021.3071878zbMATH Open1487.94187arXiv2007.15253OpenAlexW3155022315MaRDI QIDQ5032504FDOQ5032504

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)

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^{e}ll}$ and have redundancy $r=n-kgeq{q}^m$, $1leqmleqell$, 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}ll$ and $r=q^m,$ for all $1leqmleqell$. 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$ ($ageqbgeq1$), and for $mgeqell/2$ when $ell$ is even and $q$ is a power of two.

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

Recommendations

• Repairing Reed-Solomon Codes
• Repairing Reed-solomon codes
• Nonlinear Repair of Reed-Solomon Codes
• Repairing Reed-Solomon Codes With Multiple Erasures
• Subspace subcodes of Reed-Solomon codes
• Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes
• On the Sub-Packetization Size and the Repair Bandwidth of Reed-Solomon Codes
• Subspace subcodes of generalized Reed-Solomon codes
• Enabling Optimal Access and Error Correction for the Repair of Reed–Solomon Codes
• Decoding Reed-Solomon codes beyond \((d-1)/2\) and zeros of multivariate polynomials

zbMATH Keywords

Reed-Solomon codessubspace polynomialsrepair schemes

Mathematics Subject Classification ID

Other types of codes (94B60)

Cited In (4)

• Nonlinear Repair of Reed-Solomon Codes
• Repairing Reed-Solomon Codes
• Identifying High-Dimension Subspace Subcodes of Reed–Solomon Codes
• Repairing Reed-solomon codes

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)