An Elementary Proof of the First LP Bound on the Rate of Binary Codes

CoRR（2023）

引用 0|浏览7

暂无评分

摘要

The asymptotic rate vs. distance problem is a long-standing fundamental problem in coding theory. The best upper bound to date was given in 1977 and has received since then numerous proofs and interpretations. Here we provide a new, elementary proof of this bound based on counting walks in the Hamming cube.

查看译文

关键词

first lp bound,codes

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要