Abstract
An algorithm for determining the index of the maximum spectrum element of the Fourier transform is proposed. Its complexity is linear in the length of the processed sequence. The algorithm leads to the correct decision if the Euclidean distance between the sequence and a basis vector does not exceed √(q/2), where q is the length of the sequence.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S.Litsyn and O.Shekhovtsov, Fast decoding algorithm for first order Reed-Muller codes, Problems of Information Transmission, v.19, 2, pp.3–7, 1983.
R.Blahut, Fast algorithms for digital signal processing, Addison-Wesley P.C., 1985.
A.Ashikhmin and S.Litsyn, Fast decoding of nonbinary orthogonal codes, in preparation.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ashikhmin, A.E., Litsyn, S.N. (1992). A fast search for the maximum element of the fourier spectrum. In: Cohen, G., Lobstein, A., Zémor, G., Litsyn, S. (eds) Algebraic Coding. Algebraic Coding 1991. Lecture Notes in Computer Science, vol 573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034350
Download citation
DOI: https://doi.org/10.1007/BFb0034350
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55130-0
Online ISBN: 978-3-540-46739-7
eBook Packages: Springer Book Archive