有好伪随意的序列在不仅通讯系统而且密码学系统起一个重要作用。基于 Legendre-Sidelnikov 顺序,一个修改 Legendre-Sidelnikov 序列被介绍。自相关功能的准确价值被严格的计算导出。根据二个 Legendre-Sidelnikov 序列的自相关函数的值,他们俩有完美的伪随意,这被证明。而且,在二个 Legendre-Sidelnikov 序列的自相关功能之间的详细比较被推出。它显示不管哪个参数被选择,修改顺序像原始顺序一样有伪随意,它具有为应用的大意义。
Sequences with nice pseudo-randomness play an important role in not only communication system but also cryptography system. Based on the Legendre-Sidelnikov sequence, a modified Legendre-Sidelnikov sequence was introduced. The exact value of the autocorrelation function was derived by strict computation. According to the values of the autocorrelation functions of the two Legendre-Sidelnikov sequences, it is proven that both of them have perfect pseudo-randomness. Furthermore, a detailed comparison between autocorrelation functions of the two Legendre-Sidelnikov sequences was deduced. It indicates that no matter which parameters are chosen, the modified sequence has pseudo-randomness as good as the primitive sequence, which is of great significance for applications.