摘要
Families of periodic sequences with high linear span and ideal correlation property are found important in code division multiple access communication systems and cryptography. Klapper et al constructed a family of Periodic sequences named quadratically related geometric sequences, computed their auto and cross-correlation functions. The to result of Klapper is proved and improved by a much simpler new approach in this article.
Families of periodic sequences with high linear span and ideal correlation property are found important in code division multiple access communication systems and cryptography. Klapper et al constructed a family of Periodic sequences named quadratically related geometric sequences, computed their auto and cross-correlation functions. The to result of Klapper is proved and improved by a much simpler new approach in this article.
