Decoding of redundant residue polynomial codes using Euclid's algorithm

Abstract

A probabilistic algorithm for computing minimum weights of<lb>large binary emr-correcting codes is developed. This algorithm may be<lb>used to find, with a very low probability of error (10-’Oo or less in many<lb>cases), the minimum weights of codes far too large to be treated by any<lb>known exact algorithm. The probabilistic method is used to find minimum<lb>weights of all extended quadratic residue codes of length<lb>440 or less. Manuscript received September 7, 1987, revised December 2, 1987. This<lb>work was supported in part by National Science Foundation Grant MCS-<lb>8201311 and National Security Agency Grant MDA904-85-H-0016.<lb>J. S. Leon is with the Department of Mathematics, Statistics, and Computer<lb>Science, 322 Science and Engineering Offices, Box 4348, University of Illinois<lb>at Chicago, Chicago,<lb>IL 60680.<lb>IEEE Log Number 8825179.<lb>

DOI: 10.1109/18.21269

1 Figure or Table

Cite this paper

@article{Shiozaki1988DecodingOR, title={Decoding of redundant residue polynomial codes using Euclid's algorithm}, author={Akira Shiozaki}, journal={IEEE Trans. Information Theory}, year={1988}, volume={34}, pages={1351-1354} }