About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ISIT 1990
Conference paper
Decoding is really hard
Abstract
Summary form only given. The problem of maximum-likelihood decoding of linear block codes is known to be hard. It has been shown by the authors that the problem remains hard even if the code is known in advance and can be preprocessed for as long as desired in order to devise a decoding algorithm. The hardness is based on the fact that existence of a polynomial-time algorithm implies that the polynomial hierarchy collapses. This means that some linear block codes probably do not have an efficient decoder. The proof is based on results in complexity theory that relate uniform and nonuniform complexity classes.