618 citations · 1.2k across the 56 of their papers we have counts for
5 papers · 2 filters
Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes
Itzhak Tamo
Folded Reed-Solomon (FRS) and univariate multiplicity codes are prominent polynomial codes over finite fields, renowned for achieving list decoding capacity. These codes have found…
Points-Polynomials Incidence Theorem with Applications to Coding Theory
Itzhak Tamo
This paper focuses on incidences over finite fields, extending to higher degrees a result by Vinh \cite{VINH20111177} on the number of point-line incidences in the plane $\mathbb{F…
Optimal Two-Dimensional Reed--Solomon Codes Correcting Insertions and Deletions
Roni Con, Amir Shpilka, Itzhak Tamo
Constructing Reed--Solomon (RS) codes that can correct insertions and deletions (insdel errors) has been considered in numerous recent works. For the special case of two-dimensiona…
Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes
Amit Berman, Yaron Shany, Itzhak Tamo
We present algorithms for specifying the support of minimum-weight words of extended binary BCH codes of length and designed distance $d(m,s,i):=2^{m-1-s}-2^{m-1-i…
Access-Redundancy Tradeoffs in Quantized Linear Computations
Vinayak Ramkumar, Netanel Raviv, Itzhak Tamo
Linear real-valued computations over distributed datasets are common in many applications, most notably as part of machine learning inference. In particular, linear computations th…