Simple Maximum-Likelihood Decoding of Generalized First-order Reed-Muller Codes

Simple item page
dc.creatorSchmidt, Kai-Uwe
dc.creatorFinger, Adolf
dc.date2005-08-03
dc.date.accessioned2026-07-07T08:17:49Z
dc.date.available2026-07-07T08:17:49Z
dc.descriptionAn 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).
dc.description5 pages, accepted for publication in IEEE Communications Letters
dc.identifierhttps://arxiv.org/abs/cs/0508026
dc.identifierhttp://arxiv.org/abs/cs/0508026
dc.identifierIEEE Commun. Lett., vol. 9, no. 10, pp. 912-914, Oct. 2005
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134223
dc.subjectInformation Theory
dc.titleSimple Maximum-Likelihood Decoding of Generalized First-order Reed-Muller Codes
dc.typetext

Files

Collections

arXiv