Title :
The complexity of the generalized Lloyd - Max problem (Corresp.)
Author :
Johnson, D. ; Witsenhausen, Hans
fDate :
3/1/1982 12:00:00 AM
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;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1982.1056488
