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

Joshua Brakensiek, Sivakanth Gopi, Visu Makam

An $(m,n,a,b)$-tensor code consists of $m\times n$ matrices whose columns satisfy `$a$' parity checks and rows satisfy `$b$' parity checks (i.e., a tensor code is the tensor produc…