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.

翻译：渐进速率与距离问题是编码理论中一直存在的基本问题。迄今为止最好的上界是在1977年给出的，并且自那以后已经有了许多证明和解释。在这里，我们提供了一种基于汉明立方体中行走计数的新的、初等的证明方法。