A fast search for the maximum element of the Fourier spectrum

Alexey E. Ashikhmin, Simon N. Litsyn

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationAlgebraic Coding - 1st French-Soviet Workshop, Proceedings
EditorsGerard Cohen, Antoine Lobstein, Gilles Zemor, Simon Litsyn
PublisherSpringer Verlag
Pages134-141
Number of pages8
ISBN (Print)9783540551300
DOIs
StatePublished - 1992
Event1st French-Soviet Workshop on Algebraic Coding, 1991 - Paris, France
Duration: 22 Jul 199124 Jul 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume573 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st French-Soviet Workshop on Algebraic Coding, 1991
Country/TerritoryFrance
CityParis
Period22/07/9124/07/91

Fingerprint

Dive into the research topics of 'A fast search for the maximum element of the Fourier spectrum'. Together they form a unique fingerprint.

Cite this