DMCA
Soft-Decision Decoding of Reed–Muller Codes: A Simplified Algorithm (2006)
| Citations: | 3 - 0 self |
BibTeX
@MISC{Dumer06soft-decisiondecoding,
author = {Ilya Dumer},
title = {Soft-Decision Decoding of Reed–Muller Codes: A Simplified Algorithm},
year = {2006}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
oft-decision decoding is considered for general Reed–Muller (RM) codes of length and distance used over a memoryless channel. A recursive decoding algorithm is designed and its decoding threshold is derived for long RM codes. The algorithm has complexity of order � � and corrects most error patterns of the Euclidean weight of order � � instead of the decoding threshold P of the bounded distance decoding. Also, for long RM codes of fixed rate, the new algorithm increases 4/π times the decoding threshold of its hard-decision counterpart.
Keyphrases
simplified algorithm reed muller code soft-decision decoding new algorithm bounded distance decoding error pattern rm code recursive decoding algorithm euclidean weight fixed rate oft-decision decoding general reed muller hard-decision counterpart decoding threshold long rm code memoryless channel
