scientific article; zbMATH DE number 820512

zbMATH Open0835.94023MaRDI QIDQ4857258FDOQ4857258

Henk van Tilborg, Fengwen Sun

Publication date: 22 April 1996

Title of this publication is not available (Why is that?)

Recommendations

• The Nordstrom-Robinson code: representation over GF(4) and efficient decoding
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Implementation of a fast maximum-likelihood decoding algorithm for the extended Nordstrom-Robinson code
• Fast decoding of non-binary first order Reed-Muller codes
• Fast decoding algorithms for first order Reed-Muller and related codes

zbMATH Keywords

computational complexityNordstrom-Robinson codebounded-distance decoding algorithmnonlinear double-error-correcting code

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Decoding (94B35)

Cited In (4)

• Fast dimension reduction using Rademacher series on dual BCH codes
• The Nordstrom-Robinson code: representation over GF(4) and efficient decoding
• Title not available (Why is that?)
• Implementation of a fast maximum-likelihood decoding algorithm for the extended Nordstrom-Robinson code

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857258)