Citation: | CHANG Zuling, WANG Xueyuan. On the First and Second Critical Error Linear Complexity of Binary 2n-periodic Sequences[J]. Chinese Journal of Electronics, 2013, 22(1): 1-6. |
R.A. Ruppel, Analysis and Design of Stream Ciphers, NewYork: Springer-Verlag, 1986.
|
J.L. Massey, “Shift register synthesis and BCH decoding”, IEEETransactions on Information Theory, Vol.15, No.1, pp.122-127,2003.
|
M. Stamp, C.F. Martin, “An algorithm for the k-error linearcomplexity of binary sequences with period 2n”, IEEE Transactionson Information Theory, Vol.39, No.4, pp.1398-1401, 1993.
|
A. Lauder, K. Paterson, “Computing the error linear complexityspectrum of a binary sequence of period 2n”, IEEE Transactionson Information Theory, Vol.49, No.1, pp.273-280, 2003.
|
K. Kurosawa, F. Sato and W. Kishimoto, “A relation betweenlinear complexity and k-error linear complexity”, IEEE Transactionson Information Theory, Vol.46, No.2, pp.694-698, 2000.
|
T. Etzion, N. Kalouptsidis, N. Kolokotronis, K. Limniotis andK.G. Paterson, “Properties of the error linear complexity spectrum”,IEEE Transactions on Information Theory, Vol.55,No.10, pp.4681-4686, 2009.
|
J. Massey, D. Costello and J. Justesen, “Polynomial weightsand code constructions”, IEEE Transactions on InformationTheory, Vol.19, No.1, pp.101-110, 1973.
|
W. Meidl, H. Niederreiter, “On the expected value of the linearcomplexity and the k-error linear complexity of periodic sequences”,IEEE Transactions on Information Theory, Vol.48,No.11, pp.2817-2825, 2002.
|
Z. Chang, Q. Wen, “On the cryptographic properties of binary2n-periodic sequences”, Chinese Journal of Electronics, Vol.20,No.2, pp.307-311, 2011.
|