FAST DECODING OF FIRST ORDER REED-MULLER CODES IN THE GAUSSIAN CHANNEL.

S. N. Litsyn, E. E. Nemirovsky, O. I. Shekhovtsov, L. G. Mikhailovskaya

Research output: Contribution to journalArticlepeer-review

Abstract

The wide use of first order Reed-Muller codes (RM-1) in communications is determinated by their optimality and by the existence of fast algorithms for their decoding. The correlation algorithm for decoding RM-1 code was based on the algorithm of fast Walsh-Hadamard transform (FWHT) with complexity n log n where n is the RM-1 code length. We describe the new simplified algorithm which realizes the code distance and can correct a considerable number of errors of a larger weight. Correcting properties of this algorithm in the Gaussian channel are investigated by comparing it with the maximum likelihood algorithm

Original languageEnglish
Pages (from-to)189-201
Number of pages13
JournalProblems of control and information theory
Volume14
Issue number3
StatePublished - 1985

Fingerprint

Dive into the research topics of 'FAST DECODING OF FIRST ORDER REED-MULLER CODES IN THE GAUSSIAN CHANNEL.'. Together they form a unique fingerprint.

Cite this