A probabilistic algorithms for computing minimum weights of large error- correcting codes. (English) Zbl 0666.94017

A probabilistic algorithm for computing minimum weights of large binary error-correcting codes is developed. This algorithm may be used to find, with a very low probability of error \((10^{-100}\) or less in many cases), the minimum weights of codes far too large to be treated by any known exact algorithm. The probabilistic method is used to find minimum weights of all extended quadratic residue codes of length 440 or less.


94B99 Theory of error-correcting codes and error-detecting codes
Full Text: DOI