Lower bounds on t(n, k) from linear inequalities
Z. Zhang, C. Lo · IEEE Transactions on Information Theory · 1992
The linear inequality method for covering codes is used to improve the lower bounds of t(n, k), the smallest covering radius of any (n, k) binary linear code. To make better use of the strength of this method, the relation between the covering radius of a code and the minimum distance of its dual code is studied. The authors obtained 65 improved lower bounds for t(n, k) within the range of n>