Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications
Reference32 articles.
1. Bugeaud, Y., Corvaja, P., Zannier, U.: An upper bound for the G.C.D. of a n −1 and b n −1. Math. Z. 243, 79–84 (2003)
2. Chen, H.-J., Qi, W.-F.: On the distinctness of maximal length sequences over Z/(p q) modulo 2. Finite Fields Appl. 15(1), 23–39 (2009)
3. Dai, Z. D., Beth, T., Gollman, D.: Lower bounds for the linear complexity of sequences over residue ring. In: Advances in Cryptology-EUROCRYPT’90, pp 189–195. Springer, Berlin (1991). LNCS 473
4. Fan, S.-Q., Han, W.-B.: Random properties of the highest level sequences of primitive sequences over Z 2 e $Z_{2^{e}}$ . IEEE Trans. Inf. Theory 49(6), 1553–1557 (2003)
5. Fuchs, C.: An upper bound for the G.C.D. of two linear recurring sequences. Mathematica Slovaca 53(1), 21–42 (2003) http://dml.cz/dmlcz/130345
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献