Numerical results on the asymptotic rate of binary codes (Q2717190)

The authors use linear programming techniques to find numerical upper bounds on the maximal possible size of binary linear codes of length 1000, dimension \(k\) and distance \(d\). The results are presented and discussed in an interesting way to conclude that it is unlikely to get major improvements of the already known general upper bounds on the cardinality of codes by using the (pure) Delsarte's linear programming approach. The distance distributions of the hypothetical codes that would attain some of the computed bounds is discussed as well.NEWLINENEWLINEFor the entire collection see [Zbl 0960.00079].