A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Lower Bounds for Maximally Recoverable Tensor Code and Higher Order MDS Codes
[article]
2022
arXiv
pre-print
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., are tensor codes which can correct every erasure pattern that is information theoretically
arXiv:2107.10822v2
fatcat:muvcclfs2rgjhnp26beyvh6bny