• DocumentCode
    934624
  • Title

    The complexity of the generalized Lloyd - Max problem (Corresp.)

  • Author

    Johnson, D. ; Witsenhausen, Hans

  • Volume
    28
  • Issue
    2
  • fYear
    1982
  • fDate
    3/1/1982 12:00:00 AM
  • Firstpage
    255
  • Lastpage
    256
  • Abstract
    A simple (combinatorial) special case of the generalized Lloyd-Max (or quantization) problem is shown to be nondeterministic polynomial (NP)-complete. {em A fortiori}, the general problem of communication theory, in its combinatorial forms, has at least that complexity.
  • Keywords
    Quantization (signal); Signal quantization; Decoding; Distortion; Information theory; Polynomials; Quantization; Random variables;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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