Author:
Bar Yehuda Reuven,Etzion Tuvi,Moran Shlomo
Subject
General Computer Science,Theoretical Computer Science
Reference8 articles.
1. C. Ding, A fast algorithm for determining the linear complexity of sequences over GF(pm) with period pn, preprint.
2. A fast algorithm for determining the complexity of a binary sequence with a period 2n;Games;IEEE Trans. Inform. Theory,1983
3. An operator on binary sequences;Goka;SIAM Rev.,1970
4. An analysis of the structure and complexity of nonlinear binary sequence generators;Key;IEEE Trans. Inform. Theory,1976
5. Probing the rotating table;Lasser;The Mathematical Gardner,1981
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献