618 citations · 1.2k across the 56 of their papers we have counts for
7 papers · 2 filters
MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth
Ankit Singh Rawat, Itzhak Tamo, Venkatesan Guruswami +1
This paper addresses the problem of constructing MDS codes that enable exact repair of each code block with small repair bandwidth, which refers to the total amount of information…
Gradient Coding from Cyclic MDS Codes and Expander Graphs
Netanel Raviv, Itzhak Tamo, Rashish Tandon +1
Gradient coding is a technique for straggler mitigation in distributed learning. In this paper we design novel gradient codes using tools from classical coding theory, namely, cycl…
Optimal repair of Reed-Solomon codes: Achieving the cut-set bound
Itzhak Tamo, Min Ye, Alexander Barg
Coding for distributed storage gives rise to a new set of problems in coding theory related to the need of reducing inter-node communication in the system. A large number of recent…
Construction of Sidon spaces with applications to coding
Ron M. Roth, Netanel Raviv, Itzhak Tamo
A subspace of a finite extension field is called a Sidon space if the product of any two of its elements is unique up to a scalar multiplier from the base field. Sidon spaces were…
A Study on the Impact of Locality in the Decoding of Binary Cyclic Codes
M. Nikhil Krishnan, Bhagyashree Puranik, P. Vijay Kumar +2
In this paper, we study the impact of locality on the decoding of binary cyclic codes under two approaches, namely ordered statistics decoding (OSD) and trellis decoding. Given a b…
Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
Abhishek Agarwal, Alexander Barg, Sihuang Hu +2
Locally recoverable (LRC) codes have recently been a focus point of research in coding theory due to their theoretical appeal and applications in distributed storage systems. In an…