The complexity of hard-decision decoding of linear codes
Alexander Barg, Evgenii A. Krouk, Henk C. A. van Tilborg · 2002
We study a general method of minimum distance decoding of linear codes that instead of decoding the original code recovers the transmitted codeword by a number of decodings of shortened codes. We present an implementation of this method whose complexity for long linear codes has the smallest known value for any code rate R, 0<R<1.