• DocumentCode
    939557
  • Title

    The complexity of computing the covering radius of a code

  • Author

    Loughlin, Aileen M Mc

  • Author_Institution
    IEEE IT
  • Volume
    30
  • Issue
    6
  • fYear
    1984
  • fDate
    11/1/1984 12:00:00 AM
  • Firstpage
    800
  • Lastpage
    804
  • Abstract
    The problem of finding the covering radius of a binary linear code is shown to be nondeterministic polynomial (NP)-hard. In fact, a problem that is complete for the class \\prod_{2}^{p} in the polynomial hierarchy is shown to be reducible to the covering-radius problem, so that finding the covering radius is strictly harder than any NP-complete problem unless the polynomial hierarchy collapses with NP = \\prod_{2}^{p} .
  • Keywords
    Linear coding; Decoding; Error correction; Linear code; NP-complete problem; NP-hard problem; Parity check codes; Polynomials; Power measurement; Upper bound; Vectors;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1984.1056978
  • Filename
    1056978
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=939557