Author:
Yi Lin,Zeng Xiangyong,Sun Zhimin
Abstract
<p style='text-indent:20px;'>In this paper, we characterize all nonbinary sequences of length <inline-formula><tex-math id="M2">\begin{document}$ n $\end{document}</tex-math></inline-formula> with nonlinear complexity <inline-formula><tex-math id="M3">\begin{document}$ n-4 $\end{document}</tex-math></inline-formula> for <inline-formula><tex-math id="M4">\begin{document}$ n\geq9 $\end{document}</tex-math></inline-formula> and establish a formula on the number of such sequences. More generally, we characterize other finite length nonbinary sequences with large nonlinear complexity over <inline-formula><tex-math id="M5">\begin{document}$ \mathbb{Z}_{m} $\end{document}</tex-math></inline-formula>.</p>
Publisher
American Institute of Mathematical Sciences (AIMS)
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics,Computer Networks and Communications,Algebra and Number Theory,Applied Mathematics,Discrete Mathematics and Combinatorics,Computer Networks and Communications,Algebra and Number Theory
Reference16 articles.
1. C. Ding.Linear complexity of generalized cyclotomic binary sequences of order 2, Finite Fields Appl., 3 (1997), 159-174.
2. O. Geil, O. Ferruh, D. Ruano.Constructing sequences with high nonlinear complexity using the Weierstrass semigroup of a pair of distinct points of a hermitian curve, Semigroup Forum, 98 (2019), 543-555.
3. C. J. A. Jansen, Investigations on Nonlinear Streamciper Systems: Construction and Evaluation Methods, Ph.D thesis, Dept. Elect. Eng., TU Delft, Delft, The Netherlands, 1989.
4. C. J. A. Jansen and D. E. Boekee, The shortest feedback shift register that can generate a given sequence, in Advanced in Cryptography - CRYPTO'89, LNCS 435 (1990), 90–99.
5. N. Li, X. Tang.On the linear complexity of binary sequences of period $4N$ with optimal autocorrelation value/magnitude, IEEE Trans. Inf. Theory, 57 (2011), 7597-7604.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献