Soft-decision decoding of Reed-Muller codes: recursive lists

DOI10.1109/TIT.2005.864443MaRDI QIDQ3546825zbMATH OpenOpenAlexFDO

Authors Kirill Shabunov, I. I. Dumer

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1703.05305

Mathematics Subject Classification ID

Minimax procedures in statistical decision theory (62C20) Decoding (94B35)

Abstract: Recursive list decoding is considered for Reed-Muller (RM) codes. The algorithm repeatedly relegates itself to the shorter RM codes by recalculating the posterior probabilities of their symbols. Intermediate decodings are only performed when these recalculations reach the trivial RM codes. In turn, the updated lists of most plausible codewords are used in subsequent decodings. The algorithm is further improved by using permutation techniques on code positions and by eliminating the most error-prone information bits. Simulation results show that for all RM codes of length 256 and many subcodes of length 512, these algorithms approach maximum-likelihood (ML) performance within a margin of 0.1 dB. As a result, we present tight experimental bounds on ML performance for these codes.

Recommendations

• scientific article; zbMATH DE number 2154515
• Soft-decision decoding of Reed-Muller codes: a simplified algorithm
• Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes
• Soft-decision majority decoding of Reed-Muller codes
• scientific article; zbMATH DE number 1498802

Cited in

(15)

• Structural properties of self-dual monomial codes with application to code-based cryptography
• List-decoding Barnes-Wall lattices
• scientific article; zbMATH DE number 2127862 (Why is no real title available?)
• Reduced lists of error patterns for maximum likelihood soft decoding
• Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes
• List Decoding of<tex>$q$</tex>-ary Reed–Muller Codes
• Error Exponents for Recursive Decoding of Reed–Muller Codes on a Binary-Symmetric Channel
• scientific article; zbMATH DE number 2081151 (Why is no real title available?)
• Soft-decision majority decoding of Reed-Muller codes
• scientific article; zbMATH DE number 2154515 (Why is no real title available?)
• Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes
• Recursive descriptions of polar codes
• Reed-Muller Codes
• Neural decoders with permutation invariant structure
• Derivative descendants of cyclic codes and constacyclic codes

This page was built for publication: Soft-decision decoding of Reed-Muller codes: recursive lists

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