Fast bounded-distance decoding of the Nordstrom-Robinson code

F.W. Sun, H.C.A. Tilborg, van

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureHoofdstukAcademicpeer review

Samenvatting

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.
Originele taal-2Engels
TitelCommunications and cryptography : two sides of the same tapestry (Symposium in honor of James Massey on his 60th birthday, Ascona, Switzerland, February 10-14, 1994)
RedacteurenR.E. Blahut, xx et al.
Plaats van productieDordrecht
UitgeverijKluwer Academic Publishers
Pagina's391-398
ISBN van geprinte versie0-7923-9469-0
StatusGepubliceerd - 1994

Publicatie series

NaamKluwer international series in engineering and computer science
ISSN van geprinte versie0893-3405

Vingerafdruk

Duik in de onderzoeksthema's van 'Fast bounded-distance decoding of the Nordstrom-Robinson code'. Samen vormen ze een unieke vingerafdruk.

Citeer dit