Erasure codes and Turán hypercube problems
arxiv(2024)
摘要
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.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要