Title :
A probabilistic algorithm for computing minimum weights of large error-correcting codes
Author :
Leon, Jeffrey S.
Author_Institution :
Dept. of Math., Stat. & Comput. Sci., Illinois Univ., Chicago, IL, USA
fDate :
9/1/1988 12:00:00 AM
Abstract :
An algorithm is developed that can 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. The probabilistic algorithm is presented for binary codes, but it can be generalized to codes over GF(q) with q>2
Keywords :
error correction codes; probability; binary codes; error-correcting codes; minimum weights; probabilistic algorithm; quadratic residue codes; Binary codes; Computer errors; Computer science; Error correction codes; Linear code; Mathematics; National security; Statistics;
Journal_Title :
Information Theory, IEEE Transactions on
