IEEE Transactions on Information Theory · 1995 · 57 citations · 7 references
Natural SciencesMathematicsNumber TheorySequence AnalysisTime Series AnalysisAutocorrelation AnalysisCombinatorial Number TheoryFourier AnalysisDiscrete Fourier TransformUpper Bound ComputationUpper Bound Theorem
Derives a new upper bound for the odd and the aperiodic correlations of binary sequences in the small Kasami family. The approach is based on a technique described in S. Litsyn and A. Tietavainen (1994) that is originally due to I.M. Vinogradov (1954). An essential ingredient in this method is a good upper bound on the discrete Fourier coefficients of a shifted product of a pair of sequences. The author obtains an upper bound of the order O(/spl radic/LlnL) for the maximal aperiodic and odd correlation magnitudes for sequences of length L.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
7
The theory of error-correcting codes
James L. Massey · Proceedings of the IEEE · 1980 · 684 citations
Journal of the Franklin Institute · 1954 · 270 citations