Abstract
We observe that several vertex Turán type problems for the hypercube that received a considerable amount of attention in the combinatorial community are equivalent to questions about erasure list-decodable codes. Analyzing a recent construction of Ellis, Ivan and Leader, and determining the Turán density of certain hypergraph augmentations we obtain improved bounds for some of these problems.
| Original language | English (US) |
|---|---|
| Article number | 102513 |
| Journal | Finite Fields and their Applications |
| Volume | 100 |
| DOIs | |
| State | Published - Dec 2024 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Algebra and Number Theory
- General Engineering
- Applied Mathematics
Keywords
- Erasure codes
- Hypercube
- List decodable codes
- Turán problems