On MDS Condition and Erased Lines Recovery of Generalized Expanded-Blaum-Roth Codes and Generalized Blaum-Roth Codes

preprint2022arXivOpen access

Abstract

Generalized Expanded-Blaum-Roth (GEBR) codes [1] are designed for large-scale distributed storage systems that have larger recoverability for single-symbol failures, multi-column failures and multi-row failures, compared with locally recoverable codes (LRC). GEBR codes encode an α×kα\times k information array into a pτ×(k+r)pτ\times (k+r) array such that lines of slope ii with 0≤i≤r−10\leq i\leq r-1 have even parity and each column contains pτ−αpτ-α local parity symbols, where pp is an odd prime and k+r≤pτk+r\leq pτ. Necessary and sufficient conditions for GEBR codes to be (n,k)(n,k) recoverable (i.e., any kk out of n=k+rn=k+r columns can retrieve all information symbols) are given in [2] for α=(p−1)τα=(p-1)τ. However, the (n,k)(n,k) recoverable condition of GEBR codes is unknown when α<(p−1)τα<(p-1)τ. In this paper, we present the (n,k)(n,k) recoverable condition for GEBR codes for α<(p−1)τα< (p-1)τ. In addition, we present a sufficient condition for enabling GEBR codes to recover some erased lines of any slope ii (0≤i≤pτ−10\leq i\leq pτ-1) for any parameter rr when ττ is a power of pp. Moreover, we present the construction of Generalized Blaum-Roth (GBR) codes that encode an α×kα\times k information array into an α×(k+r)α\times (k+r) array. We show that GBR codes share the same MDS condition as the (n,k)(n,k) recoverable condition of GEBR codes, and we also present a sufficient condition for GBR codes to recover some erased lines of any slope ii (0≤i≤α−10\leq i\leq α-1).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.