Fast ML decoding algorithm for the Nordstrom - Robinson code (Corresp.)
J.-P. Adoul · IEEE Transactions on Information Theory · 1987
The extended Nordstrom-Robinson code is an optimum nonlinear double-error-correcting code of length16with considerable practical importance. This code is also useful as a rate1/2vector quantizer for random waveforms such as speech linear-predictive-coding (LPC) residual. A fast decoding algorithm is described for maximum likelihood decoding (or nearest neighbor search in the squared-error sense) with304additions and128comparisons.