Itzhak Tamo

activity

20092026

most citedA family of optimal locally recoverable codes

618 citations · 1.2k across the 56 of their papers we have counts for

collaborators

Showing 2020Show all

4 papers · 1 filter

cs.IT2020

Repairing Reed-Solomon Codes Evaluated on Subspaces

Amit Berman, Sarit Buzaglo, Avner Dor +2

We consider the repair problem for Reed--Solomon (RS) codes, evaluated on an $F_{q}$ -linear subspace $U \subseteq F_{q^{m}}$ of dimension $d$ , where $q$ is a prime powe…

cs.IT2020★ 4 cited

Improved List-Decodability of Reed--Solomon Codes via Tree Packings

Zeyu Guo, Ray Li, Chong Shangguan +2

This paper shows that there exist Reed--Solomon (RS) codes, over \black{exponentially} large finite fields \black{in the code length}, that are combinatorially list-decodable well…

cs.IT2020★ 1 cited

Error Detection and Correction in Communication Networks

Chong Shangguan, Itzhak Tamo

Let $G$ be a connected graph on $n$ vertices and $C$ be an $(n, k, d)$ code with $d \geq 2$ , defined on the alphabet set ${0, 1}^{m}$ . Suppose that for $1 \leq i \leq n$ , the $i$ -th vertex…

math.CO2020

New Turán exponents for two extremal hypergraph problems

Chong Shangguan, Itzhak Tamo

An $r$ -uniform hypergraph is called $t$ -cancellative if for any $t + 2$ distinct edges $A_{1}, \dots, A_{t}, B, C$ , it holds that $(\cup_{i = 1}^{t} A_{i}) \cup B \neq = (\cup_{i = 1}^{t} A_{i}) \cup C$ . It…