Abstract:
An algorithm is developed that can be used to find, with a very low probability of error (10/sup -100/ or less in many cases), the minimum weights of codes far too large ...Show MoreMetadata
First Page of the Article
Abstract:
An algorithm is developed that can be used to find, with a very low probability of error (10/sup -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. The probabilistic algorithm is presented for binary codes, but it can be generalized to codes over GF(q) with q>2.<>
Published in: IEEE Transactions on Information Theory ( Volume: 34, Issue: 5, September 1988)
DOI: 10.1109/18.21270
First Page of the Article
