Author:
Zheng Qun-Xiong,Qi Wen-Feng,Tian Tian
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference27 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. Bylkov D.N., Nechaev A.A.: An algorithm to restore a linear recurring sequence over the ring $${R=\mathbf{Z}_{p^{n}}}$$ from a linear complication of its highest coordinate sequence. Discr. Math. Appl. 20(5–6), 591–609 (2010)
3. Chen H.J., Qi W.F.: On the distinctness of maximal length sequences over $${\mathbf{Z}/(pq)}$$ modulo 2. Finite Fields Appl. 15, 23–39 (2009)
4. Dai Z.D., Beth T., Gollman D.: Lower bounds for the linear complexity of sequences over residue ring. In: Advances in Cryptology: Eurocrypt 1990. LNCS, vol. 473, pp. 189–195. Springer, Berlin (1991).
5. Dai Z.D.: Binary sequences derived from ML-sequences over rings I: periods and minimal polynomials. J. Cryptol. 5, 193–207 (1992)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献