We continue the study of list recovery properties of high-rate tensor codes, initiated by Hemenway, Ron-Zewi, and Wootters (FOCS'17). In that work it was shown that the tensor product of an efficient (poly-time) high-rate globally list recoverable code is approximately locally list recoverable, as well as globally list recoverable in probabilistic near-linear time. This was used in turn to give the first capacity-achieving list decodable codes with (1) local list decoding algorithms, and with (2) probabilistic near-linear time global list decoding algorithms. This also yielded constant-rate codes approaching the Gilbert-Varshamov bound with probabilistic near-linear time global unique decoding algorithms. In the current work we obtain the f...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
Erasure codes play an important role in storage systems to prevent data loss. In this work, we study...
Given a topology of local parity-check constraints, a maximally recoverable code (MRC) can correct a...
We continue the study of list recovery properties of high-rate tensor codes, initiated by Hemenway, ...
We continue the study of list recovery properties of high-rate tensor codes, initiated by Hemenway, ...
Abstract. We design the first efficient algorithms and prove new combinatorial bounds for list decod...
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membe...
Tensors, i.e., multi-linear functions, are a fundamental building block of machine learning algorith...
A family of error-correcting codes is listdecodable from error fraction p if, for every code in the ...
In this work, we prove new results concerning the combinatorial properties of random linear codes. B...
This paper considers the natural extension of locally recoverable codes (LRC) to the case of t > 1 e...
An $(m,n,a,b)$-tensor code consists of $m\times n$ matrices whose columns satisfy `$a$' parity check...
In this work we consider the list-decodability and list-recoverability of arbitrary q-ary codes, for...
Given two codes R and C, their tensor product R⊗C consists of all matrices whose rows are codewords ...
An n-length block code C is said to be r-query locally correctable, if for any codeword x ∈ C, one c...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
Erasure codes play an important role in storage systems to prevent data loss. In this work, we study...
Given a topology of local parity-check constraints, a maximally recoverable code (MRC) can correct a...
We continue the study of list recovery properties of high-rate tensor codes, initiated by Hemenway, ...
We continue the study of list recovery properties of high-rate tensor codes, initiated by Hemenway, ...
Abstract. We design the first efficient algorithms and prove new combinatorial bounds for list decod...
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membe...
Tensors, i.e., multi-linear functions, are a fundamental building block of machine learning algorith...
A family of error-correcting codes is listdecodable from error fraction p if, for every code in the ...
In this work, we prove new results concerning the combinatorial properties of random linear codes. B...
This paper considers the natural extension of locally recoverable codes (LRC) to the case of t > 1 e...
An $(m,n,a,b)$-tensor code consists of $m\times n$ matrices whose columns satisfy `$a$' parity check...
In this work we consider the list-decodability and list-recoverability of arbitrary q-ary codes, for...
Given two codes R and C, their tensor product R⊗C consists of all matrices whose rows are codewords ...
An n-length block code C is said to be r-query locally correctable, if for any codeword x ∈ C, one c...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
Erasure codes play an important role in storage systems to prevent data loss. In this work, we study...
Given a topology of local parity-check constraints, a maximally recoverable code (MRC) can correct a...