Title :
Some applications of Good´s theorem (Corresp.)
fDate :
7/1/1980 12:00:00 AM
Abstract :
Three applications of a theorem of I. J. Good are made: a simplification of the fast Hadamard transform algorithm of R.R. Green used in the decoding of first-order Reed-Muller codes, a simple proof of the well-known Parseval formula, and an application to the discrete one-dimensional Fourier transform.
Keywords :
DFT; Discrete Fourier transforms (DFT´s); Hadamard transforms; Reed-Muller codes; Circuits; Discrete transforms; Error correction; Error correction codes; Fast Fourier transforms; Fourier transforms; Iterative decoding; Maximum likelihood decoding; Sparse matrices; Symmetric matrices;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1980.1056211