Fast bounded-distance decoding of the Nordstrom-Robinson code

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review


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.
Original languageEnglish
Title of host publicationCommunications and cryptography : two sides of the same tapestry (Symposium in honor of James Massey on his 60th birthday, Ascona, Switzerland, February 10-14, 1994)
EditorsR.E. Blahut, xx et al.
Place of PublicationDordrecht
PublisherKluwer Academic Publishers
ISBN (Print)0-7923-9469-0
Publication statusPublished - 1994

Publication series

NameKluwer international series in engineering and computer science
ISSN (Print)0893-3405


Dive into the research topics of 'Fast bounded-distance decoding of the Nordstrom-Robinson code'. Together they form a unique fingerprint.

Cite this