Recursive error correction for general Reed--Muller codes

DOI10.1016/j.dam.2005.05.013zbMath1091.94043OpenAlexW1991539936MaRDI QIDQ2489920

I. I. Dumer, Kirill Shabunov

Publication date: 28 April 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.05.013

zbMATH Keywords

recursive decodingdecoding thresholdPlotkin construction

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Related Items (1)

List-decoding Barnes-Wall lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Decoding of Reed-Muller codes with a large number of errors
• Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes
• Soft-decision majority decoding of Reed-Muller codes
• Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes

This page was built for publication: Recursive error correction for general Reed--Muller codes