Author:
Meidl Wilfried,Venkateswarlu Ayineedi
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference12 articles.
1. Ding C, Xiao G, Shan W (1991) The stability theory of stream ciphers. Lecture notes in computer science 561. Springer-Verlag, Berlin Heidelberg New York
2. Games RA, Chan AH (1983) A fast algorithm for determining the complexity of a binary sequence with period 2 n . IEEE Trans Inform Theory 29:144–146
3. Kaida T, Uehara S, Imamura K (1999) A new algorithm for the k-error linear complexity of sequences over GF(p m ) with period p n . In: Ding C, Helleseth T, Niederreiter H (eds) Sequences and their applications. Springer-Verlag, London, pp 284–296
4. Kaida T (2004) On the generalized Lauder-Paterson algorithm and profiles of the k-error linear complexity over GF(3) with period 9. In: Proceedings (extended abstracts) of the international conference on Sequences and their applications. Seoul, pp 24–28
5. Kurosawa K, Sato F, Sakata T, Kishimoto W (2000) A relationship between linear complexity and k-error linear complexity. IEEE Trans Inform Theory 46:694–698
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献