Erasure codes and Turán hypercube problems
Noga Alon
TL;DR
It is observed that several vertex Tur\'an type problems for the hypercube are equivalent to questions about erasure list-decodable codes and improved bounds are obtained for some of these problems.
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 augemntations we obtain improved bounds for some of these problems.
