Z8-Kerdock codes and pseudorandom binary sequences
Journal of Complexity - Special issue on coding and cryptography
Evolution of CDMA from interference-limited to noise-limited
Wireless communications systems and networks
Distribution of r-patterns in the most significant bit of a maximum length sequence over Z2l
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
New pairs of m-sequences with 4-level cross-correlation
Finite Fields and Their Applications
Hi-index | 754.84 |
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(√LlnL) for the maximal aperiodic and odd correlation magnitudes for sequences of length L