摘要
In the theory of error-correcting codes, to find the true minimum distance of given linear codes is very important and difficult, and up to now it has not been solved. Many researchers have derived many ways to find the minimum distancebound. In this paper a general theorem about the minimum distance bound is derived. This theorem generalizes many other theorems about the minimum distance bound. Let A and B be the matrices over field F.
