On Constructions of Reed-Muller Subcodes

Wonterghem, Johannes Van; Boutros, Joseph J.; Moeneclaey, Marc

doi:10.1109/lcomm.2017.2772247

Search citation statements

Order By: Relevance

Paper Sections

Select...

Performance Comparison Of Short-length Error-correcting Codes1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2018

2024

Publication Types

Select...

Book3

Article2

Relationship

Self Cite1

Independent4

Authors

Journals

Cited by 7 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• Reed-Muller codes: A (256,128) Reed-Muller subcode is constructed from the (256,163) Reed-Muller code using the greedy algorithm described in [20].…”

Section: Performance Comparison Of Short-length Error-correcting Codesmentioning

confidence: 99%

On short-length error-correcting codes for 5G-NR

et al. 2018

Self Cite

View full text Add to dashboard Cite

We compare the performance of a selection of short-length and very short-length linear binary error-correcting codes on the binary-input Gaussian noise channel, and on the fast and quasi-static flat Rayleigh fading channel. We use the probabilistic Ordered Statistics Decoder, that is universal to any code construction. As such we compare codes and not decoders. The word error rate versus the signal-to-noise ratio is found for LDPC, Reed-Muller, Polar, Turbo, Golay, random, and BCH codes at length 20, 32 and 256 bits. BCH and random codes outperform other codes in absence of a cyclic redundancy check concatenation. Under joint decoding, the concatenation of a cyclic redundancy check makes all codes perform very close to optimal lower bounds. Optimizations of the Ordered Statistics Decoder are discussed and revealed to bring near-ML performance with a notable complexity reduction, making the decoding complexity at very short length affordable.

show abstract

“…• Reed-Muller codes: A (256,128) Reed-Muller subcode is constructed from the (256,163) Reed-Muller code using the greedy algorithm described in [20].…”

Section: Performance Comparison Of Short-length Error-correcting Codesmentioning

confidence: 99%