@inproceedings{fc697b62138348bda62ead2a24d87017,

title = "A fast search for the maximum element of the Fourier spectrum",

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.",

author = "Ashikhmin, {Alexey E.} and Litsyn, {Simon N.}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1992.; 1st French-Soviet Workshop on Algebraic Coding, 1991 ; Conference date: 22-07-1991 Through 24-07-1991",

year = "1992",

doi = "10.1007/bfb0034350",

language = "אנגלית",

isbn = "9783540551300",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "134--141",

editor = "Gerard Cohen and Antoine Lobstein and Gilles Zemor and Simon Litsyn",

booktitle = "Algebraic Coding - 1st French-Soviet Workshop, Proceedings",

}