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.展开更多
A new code concept is used for the L1 civil（L1C） signal of the global positioning system（GPS）.The generation of L1C codes is quite different from the generation of traditional ranging codes.Thus,it is necessary to...A new code concept is used for the L1 civil（L1C） signal of the global positioning system（GPS）.The generation of L1C codes is quite different from the generation of traditional ranging codes.Thus,it is necessary to find a method for the correct generation to pave the way for future research.L1C codes are based on only one Legendre sequence which consists of Legendre symbols.To calculate these Legendre symbols,the Euler criterion is always used to evaluate quadratic residues.However,due to the great length of L1C codes,this procedure causes overflow problems.Therefore,the quadratic reciprocity law,some related theorems and properties are introduced to solve the problems.Moreover,if the quadratic reciprocity law,some related theorems and properties are used to calculate different Legendre symbols,the combination modes may vary,which causes a complex generation process.The proposed generation method deals with this complex generation process effectively.In addition,through simulations,it is found that the autocorrelation features of obtained Legendre sequences and L1C codes are in accordance with theoretical results,which proves the correctness of the proposed method.展开更多
文摘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.
基金supported by the National High Technology Research and Development Program of China(863Program)(2011AA110101)the National Basic Research Program of China(973Program)(2009CB724002)
文摘A new code concept is used for the L1 civil（L1C） signal of the global positioning system（GPS）.The generation of L1C codes is quite different from the generation of traditional ranging codes.Thus,it is necessary to find a method for the correct generation to pave the way for future research.L1C codes are based on only one Legendre sequence which consists of Legendre symbols.To calculate these Legendre symbols,the Euler criterion is always used to evaluate quadratic residues.However,due to the great length of L1C codes,this procedure causes overflow problems.Therefore,the quadratic reciprocity law,some related theorems and properties are introduced to solve the problems.Moreover,if the quadratic reciprocity law,some related theorems and properties are used to calculate different Legendre symbols,the combination modes may vary,which causes a complex generation process.The proposed generation method deals with this complex generation process effectively.In addition,through simulations,it is found that the autocorrelation features of obtained Legendre sequences and L1C codes are in accordance with theoretical results,which proves the correctness of the proposed method.
