Simple Maximum-Likelihood Decoding of Generalized First-order Reed-Muller Codes
Information Theory
2007-07-16 v1 math.IT
Abstract
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).
Cite
@article{arxiv.cs/0508026,
title = {Simple Maximum-Likelihood Decoding of Generalized First-order Reed-Muller Codes},
author = {Kai-Uwe Schmidt and Adolf Finger},
journal= {arXiv preprint arXiv:cs/0508026},
year = {2007}
}
Comments
5 pages, accepted for publication in IEEE Communications Letters