Corpus ID: 236170940

Lower Bounds for Maximally Recoverable Tensor Code and Higher Order MDS Codes

  title={Lower Bounds for Maximally Recoverable Tensor Code and Higher Order MDS Codes},
  author={Joshua Brakensiek and Sivakanth Gopi and Visu Makam},
An (m, n, a, b)-tensor code consists of m×n matrices whose columns satisfy ‘a’ parity checks and rows satisfy ‘b’ parity checks (i.e., a tensor code is the tensor product of a column code and row code). Tensor codes are useful in distributed storage because a single erasure can be corrected quickly either by reading its row or column. Maximally Recoverable (MR) Tensor Codes, introduced by Gopalan et al. [GHK17], are tensor codes which can correct every erasure pattern that is information… Expand


On Maximally Recoverable Codes for Product Topologies
This paper constructs a certain bipartite graph based on the erasure pattern satisfying the regularity condition for product topology (any $a, b, h = 0) and shows that there exists a complete matching in this graph and presents an alternate direct proof of the sufficient condition. Expand
On the Locality of Codeword Symbols
A tight bound for the locality of parity symbols possible in such codes for a broad class of parameter settings is obtained and it is proved that there is a tradeoff between having good locality and the ability to correct erasures beyond the minimum distance. Expand
Maximally Recoverable LRCs: A field size lower bound and constructions for few heavy parities
The first non-trivial lower bounds on the field size required for MR LRCs are shown and a surprising application of elliptic curves and arithmetic progression free sets in the construction of MR L RCs is shown. Expand
The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes
The upper bound is a recursive construction which beats the random construction and the lower bound follows by first relating the problem to the independence number of the Birkhoff polytope graph, and then providing tight bounds for it using the representation theory of the symmetric group. Expand
Correctable Erasure Patterns in Product Topologies
This work considers a generalization introduced by Gopalan et al., where, viewing the codewords as arrays, constraints are imposed on the columns and rows in addition to some global constraints, and presents a generic method of adding such global parity-checks. Expand
New Bounds on the Field Size for Maximally Recoverable Codes Instantiating Grid-like Topologies
This paper establishes the first polynomial upper bound on the field size needed for achieving the maximal recoverability in topologies $T_{m\times n}(1,b,0)$, when $n$ is large enough. Expand
On the Maximally Recoverable Property for Multi-Protection Group Codes
It is shown that both recoverability and minimum decoding overhead of any MPG code with MR property depend only on the configuration, where decoding overhead is defined as the additional number of symbols to access, in order to decode the lost data symbols. Expand
Maximally Recoverable Codes for Grid-like Topologies
A family of topologies called grid-like topologies are proposed which unify a number of topology considered both in theory and practice, and prove a collection of results about maximally recoverable codes in such topologies including the first super-polynomial lower bound on the field size. Expand
XORing Elephants: Novel Erasure Codes for Big Data
A novel family of erasure codes that are efficiently repairable and offer higher reliability compared to Reed-Solomon codes are presented, which provides higher reliability, which is orders of magnitude higher compared to replication. Expand
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Vanous fast probabdlsttc algonthms, with probability of correctness guaranteed a prion, are presented for testing polynomial ldentmes and propemes of systems of polynomials and ancdlary fast algorithms for calculating resultants and Sturm sequences are given. Expand