Simple Maximum-Likelihood Decoding of Generalized First-order Reed-Muller Codes
Abstract
An efficient decoder for the generalized first-order Reed-Muller code RMq(1,m) is essential for the decoding of various block-coding schemes for orthogonal frequency-division multiplexing with reduced peak-to-mean power ratio. We present an efficient and simple maximum-likelihood decoding algorithm for RMq(1,m). It is shown that this algorithm has lower complexity than other previously known maximum-likelihood decoders for RMq(1,m).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.