Simple Maximum-Likelihood Decoding of Generalized First-order Reed-Muller Codes
<|reference_start|>Simple Maximum-Likelihood Decoding of Generalized First-order Reed-Muller Codes: An efficient decoder for the generalized first-order Reed-Muller code RM_q(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 RM_q(1,m). It is shown that this algorithm has lower complexity than other previously known maximum-likelihood decoders for RM_q(1,m).<|reference_end|>
@article{schmidt2005simple,
    title={Simple Maximum-Likelihood Decoding of Generalized First-order
  Reed-Muller Codes},
    author={Kai-Uwe Schmidt and Adolf Finger},
    journal={IEEE Commun. Lett., vol. 9, no. 10, pp. 912-914, Oct. 2005},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0508026},
    primaryClass={cs.IT math.IT}
}