• DocumentCode
    894290
  • 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
  • Volume
    34
  • Issue
    5
  • fYear
    1988
  • fDate
    9/1/1988 12:00:00 AM
  • Firstpage
    1354
  • Lastpage
    1359
  • 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;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.21270
  • Filename
    21270
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=894290