Author:
Fúster-Sabater A.,Garcı́a-Villalba L.J.
Subject
General Computer Science,Theoretical Computer Science
Reference10 articles.
1. A. Fúster-Sabater, P. Caballero-Gil, in: On the linear complexity of nonlinearly filtered PN-sequences, Adv. Cryptology-ASIACRYPT’94, Lecture Notes in Computer Science, vol. 917, Springer, Berlin, 1994.
2. On the general classification of nonlinear filters of m-sequences;Garcı́a-Villalba;Inform. Process. Lett.,1999
3. Shift Register-Sequences;Golomb,1982
4. An Analysis of the structure and complexity of non-linear binary sequence generators;Key;IEEE Trans. Inform. Theory,1976
5. Bounds on the linear span of bent sequences;Kumar;IEEE Trans. Inform. Theory,1983
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献