By Topic

Fast ML decoding algorithm for the Nordstrom - Robinson code (Corresp.)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

The extended Nordstrom-Robinson code is an optimum nonlinear double-error-correcting code of length 16 with considerable practical importance. This code is also useful as a rate 1/2 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 304 additions and 128 comparisons.

Published in:

Information Theory, IEEE Transactions on  (Volume:33 ,  Issue: 6 )