The Gleason-Prange theorem
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 37 (5) , 1269-1273
- https://doi.org/10.1109/18.133245
Abstract
The Gleason-Prange theorem describes a nontrivial automorphism of an extended quadratic residue code. By using the Fourier transform in an appropriate extension field, methods of digital signal processing are used to make the proof transparent and the automorphism intuitive. The theorem is proved both in a field of characteristic tow and in an arbitrary field and is stated simply as a general property of the discrete Fourier transformKeywords
This publication has 4 references indexed in Scilit:
- On Computing the Discrete Fourier TransformMathematics of Computation, 1978
- On computing the Discrete Fourier TransformProceedings of the National Academy of Sciences, 1976
- New 5-designsJournal of Combinatorial Theory, 1969
- Discrete Fourier transforms when the number of data samples is primeProceedings of the IEEE, 1968