Title :
A fast algorithm for the k-error linear complexity of a binary sequence
Author :
Wei, Shimin ; Chen, Zhong ; Xiao, Guozhen
Author_Institution :
Dept. of Comput. Sci. & Technol., Peking Univ., Beijing, China
Abstract :
An efficient algorithm is presented for computing the k-error linear complexity of a binary sequence with period pn, where 2 is a primitive root modulo p2. The new algorithm is a generalization of an algorithm over a binary field presented by Xiao et al. (1999)
Keywords :
Galois fields; binary sequences; communication complexity; cryptography; Galois fields; binary field; binary sequence; cryptography; k-error linear complexity; Artificial intelligence; Binary sequences; Computer science; Cryptography; Information security; Polynomials;
Conference_Titel :
Info-tech and Info-net, 2001. Proceedings. ICII 2001 - Beijing. 2001 International Conferences on
Conference_Location :
Beijing
Print_ISBN :
0-7803-7010-4
DOI :
10.1109/ICII.2001.983510
