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 math.COShow all

6 papers · 1 filter

math.CO2024

Combinatorial alphabet-dependent bounds for insdel codes

Xiangliang Kong, Itzhak Tamo, Hengjia Wei

Error-correcting codes resilient to synchronization errors such as insertions and deletions are known as insdel codes. Due to their important applications in DNA storage and comput…

math.CO2024

A point-variety incidence theorem over finite fields, and its applications

Xiangliang Kong, Itzhak Tamo

Incidence problems between geometric objects is a key area of focus in the field of discrete geometry. Among them, the study of incidence problems over finite fields have received…

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…

math.CO2019

Degenerate Turán densities of sparse hypergraphs

Chong Shangguan, Itzhak Tamo

For fixed integers $r > k \geq 2, e \geq 3$ , let $f_{r} (n, er - (e - 1) k, e)$ be the maximum number of edges in an $r$ -uniform hypergraph in which the union of any $e$ distinct edges contains at…

math.CO2019

Sparse Hypergraphs with Applications to Coding Theory

Chong Shangguan, Itzhak Tamo

For fixed integers $r \geq 3, e \geq 3, v \geq r + 1$ , an $r$ -uniform hypergraph is called $G_{r} (v, e)$ -free if the union of any $e$ distinct edges contains at least $v + 1$ vertices.…

math.CO2018

The hat guessing number of graphs

Noga Alon, Omri Ben-Eliezer, Chong Shangguan +1

Consider the following hat guessing game: $n$ players are placed on $n$ vertices of a graph, each wearing a hat whose color is arbitrarily chosen from a set of $q$ possible colors.…