[1] |
SIDELNIKOV V M . Some k-valued pseudo-random and nearly equidistant code[J]. Problems of Information Transmission, 1969,5(1): 16-22.
|
[2] |
LEMPEL A , COHN M , EASTMAN W L . A class of balanced binary sequences with optimal autocorrelation properties[J]. IEEE Transactions on Information Theory, 1977,23(1): 38-42.
|
[3] |
KYUREGHYAN G M , POTT A . On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences[J]. Designs Codes &Cryptography, 2003,49(1-3): 149-164.
|
[4] |
HELLESETH H , KIM S H , NO J S . Linear complexity over Fp and trace representation of Lembel-Cohn-Eastman sequences[J]. IEEE Transactions on Information Theory, 2003,49(6): 1548-1552.
|
[5] |
HELLESETH H , MAAS M , MATHIASSN J E ,et al. Linear complexity over Fp of Sidel’nikov sequences[J]. IEEE Transactions on Information Theory, 2004,50(10): 2468-2472.
|
[6] |
MEIDL W , WINTERHOF A . Some notes on the linear complexity of Sidel’nikov-Lempel-Cohn-Eastman sequences[J]. Designs Codes &Cryptography, 2006,38(2): 159-178.
|
[7] |
EUN Y C , SONG H Y , KYUREGHYAN G M . One-error linear complexity over Fp of Sidelnikov sequences[C]// International Conference on Algorithmic Applications in Management. Springer, 2004, 154-165.
|
[8] |
GARAEV M Z , LUCA F , SHPARLINSKI I E ,et al. On the lower bound of the linear complexity over Fp of Sidelnikov sequences[J]. IEEE Transactions on Information Theory, 2006,52(7): 3299-3304.
|
[9] |
SU M . On the linear complexity of Legendre-Sidelnikov sequences[J]. Designs Codes & Cryptography, 2015,74(3): 703-717.
|
[10] |
SABAN A , MILLAR G . Character values of the SidelnikovLempel-Cohn-Eastman sequences[J]. Cryptography & Communications, 2016,9(6): 1-18.
|
[11] |
MYERSON G . Period polynomials and Gauss sums for finite fields[J]. ACTA Arithmetica, 1981,39(3): 251-264.
|
[12] |
KLAPPER A , GORESKY M . Feedback shift registers,2-adic span,and combiners with memory[J]. Journal of Cryptology, 1997,10(2): 111-147.
|
[13] |
TIAN T , QI W F . Adic complexity of binary-sequences[J]. IEEE Transactions on Information Theory , 2010,56(1): 450-454.
|
[14] |
XIONG H , QU L , LI C . A new method to compute the 2-adic complexity of binary sequences[J]. IEEE Transactions on Information Theory, 2014,60(4): 2399-2406.
|
[15] |
HU H G . Comments on “a new method to compute the 2-adic complexity of binary sequences”[J]. IEEE Transactions on Information Theory, 2014,60(9): 5803-5804.
|
[16] |
DING C S . Stream ciphers and number theory[M]. Amsterdam: ElsevierPress, 2004: 113-114.
|