Erasure codes and Turán hypercube problems
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914727604518912 |
|---|---|
| author | Alon, Noga |
| author_facet | Alon, Noga |
| contents | 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 augemntations we obtain improved bounds for some of these problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_16319 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Erasure codes and Turán hypercube problems Alon, Noga Combinatorics 05C35, 94B65 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 augemntations we obtain improved bounds for some of these problems. |
| title | Erasure codes and Turán hypercube problems |
| topic | Combinatorics 05C35, 94B65 |
| url | https://arxiv.org/abs/2403.16319 |