DocumentCode :
943543
Title :
Fast ML decoding algorithm for the Nordstrom - Robinson code (Corresp.)
Author :
Doul, Jean-pierrea
Volume :
33
Issue :
6
fYear :
1987
fDate :
11/1/1987 12:00:00 AM
Firstpage :
931
Lastpage :
933
Abstract :
The extended Nordstrom-Robinson code is an optimum nonlinear double-error-correcting code of length 
with considerable practical importance. This code is also useful as a rate 
vector 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) with 
additions and 
comparisons.
with considerable practical importance. This code is also useful as a rate vector 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) with additions and comparisons.Keywords :
Error-correction coding; Hadamard transforms; Speech coding; maximum-likelihood (ML) decoding; Binary codes; Code standards; Computer errors; Equations; Inspection; Linear predictive coding; Maximum likelihood decoding; Reflective binary codes; Speech coding; Speech processing;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1987.1057368
Filename :
1057368
Link To Document :
