The sphere bound is a trivial lower bound on K(n,R), the minimal cardinality of any binary code of length n and with covering radius R. By simple arguments it is considerably improved, to K(n,1)or=33, R>or=10 is included.
展开▼
机译：球面边界是K（n，R）上的小数下界，K（n，R）是长度为n且覆盖半径为R的任何二进制代码的最小基数。通过简单的论证，它得到了相当大的改进，达到K（n，1） or = 33，R> or = 10的K（n，R）的上下限。
展开▼
