Binary sequences constructed by Legendre symbols are widely used in communication and cryptography since they have many good pseudo-random properties.In this paper,we determine the 2-adic complexity of the sum sequenc...Binary sequences constructed by Legendre symbols are widely used in communication and cryptography since they have many good pseudo-random properties.In this paper,we determine the 2-adic complexity of the sum sequence of any k many Legendre sequences and show that the 2-adic complexity of the sum sequences of any k many Legendre sequences reaches the maximum by proving the case of k=2 and 3,which implies that the sum sequences can resist the attack of rational approximation algorithm.展开更多
引进了弱n-adic集映射和具有全n-adic集系统的概念,讨论了弱n-adic集映射具有正拓扑熵条件和具有全n-adic集系统在回复性上的混沌性。证明了n不是2的倍数的n-adic系统是Devaney混沌的,Wiggins混沌的,按序列分布混沌的,分布混沌的,Marte...引进了弱n-adic集映射和具有全n-adic集系统的概念,讨论了弱n-adic集映射具有正拓扑熵条件和具有全n-adic集系统在回复性上的混沌性。证明了n不是2的倍数的n-adic系统是Devaney混沌的,Wiggins混沌的,按序列分布混沌的,分布混沌的,Martelli’s混沌的,ω混沌的,Block and cop-ple混沌的。展开更多
文摘Binary sequences constructed by Legendre symbols are widely used in communication and cryptography since they have many good pseudo-random properties.In this paper,we determine the 2-adic complexity of the sum sequence of any k many Legendre sequences and show that the 2-adic complexity of the sum sequences of any k many Legendre sequences reaches the maximum by proving the case of k=2 and 3,which implies that the sum sequences can resist the attack of rational approximation algorithm.
文摘引进了弱n-adic集映射和具有全n-adic集系统的概念,讨论了弱n-adic集映射具有正拓扑熵条件和具有全n-adic集系统在回复性上的混沌性。证明了n不是2的倍数的n-adic系统是Devaney混沌的,Wiggins混沌的,按序列分布混沌的,分布混沌的,Martelli’s混沌的,ω混沌的,Block and cop-ple混沌的。
