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

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

2005-08-03

arxiv.org/abs/cs/0508026v1

IEEE Commun. Lett., vol. 9, no. 10, pp. 912-914, Oct. 2005

Computer Science

Information Theory

5 pages, accepted for publication in IEEE Communications Letters

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

Simple Maximum-Likelihood Decoding of Generalized First-order Reed-Muller Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simple Maximum-Likelihood Decoding of Generalized First-order Reed-Muller Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simple Maximum-Likelihood Decoding of Generalized First-order Reed-Muller Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-39919