Based on the two-level squaring construction of the Reed-Muller code, a bounded-distance decoding algorithm for the Nordstrom-Robinson code is given. This algorithm involves 199 real operations, which is less than one half of the computational complexity of the known maximum-likelihood decoding algorithms for this code. The algorithm also has exactly the same effective error coefficient as the maximum-likelihood decoding, so that its performance is only degraded by a negligible amount.
|Title of host publication
|Communications and cryptography : two sides of the same tapestry (Symposium in honor of James Massey on his 60th birthday, Ascona, Switzerland, February 10-14, 1994)
|R.E. Blahut, xx et al.
|Place of Publication
|Kluwer Academic Publishers
|Published - 1994
|Kluwer international series in engineering and computer science