On the Stability of the Linear Complexity of Some Generalized Cyclotomic Sequences of Order Two
Abstract
:1. Introduction
2. Preliminary
3. Linear Complexity and Discrete Fourier Transform
- 1.
- If , then .
- 2.
- If , then .
- 3.
- If , then .
- 4.
- If , then .
- 1.
- if and only if
- 2.
- if and only if
- 3.
- if and only if
- 1.
- If , then , .
- 2.
- If , then , .
- If , then
- If , then
4. The 1-Error Linear Complexity
5. Conclusions
Author Contributions
Funding
Data Availability Statement
Acknowledgments
Conflicts of Interest
References
- Cusick, T.W.; Ding, C.; Renvall, A. Stream Ciphers and Number Theory; Elsevier Science: Amsterdam, The Netherlands, 2004. [Google Scholar]
- Niu, Z.; Yuan, C.; Chen, Z.; Du, X.; Zhang, T. On the k-error linear complexity of 2p2-periodic binary sequences. Sci. China Inf. Sci. 2020, 63, 199101. [Google Scholar] [CrossRef]
- Massey, J. Shift-register synthesis and BCH decoding. IEEE Trans. Inform. Theory 1969, 15, 122–127. [Google Scholar] [CrossRef]
- Yan, M.; Yan, T.; Li, Y. Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of periods of twin prime products. Cryptogr. Commu. 2021, 13, 15–26. [Google Scholar] [CrossRef]
- Bai, E.; Liu, X.; Xiao, G. Linear complexity of new generalized cyclotomic sequences of order two of length pq. IEEE Trans. Inf. Theory 2005, 51, 1849–1853. [Google Scholar] [CrossRef]
- He, X.; Chen, Y.; Zhao, G. (p + 1)/2-error linear complexity of generalized cyclotomic sequences. In ChinaCrypt2008; Chinese Association for Cryptologic Research: Wuhan, China, 2008; pp. 172–177. (In Chinese) [Google Scholar]
- Du, X.; Yan, T.; Xiao, G. Trace representation of some generalized cyclotomic sequences of length pq. Inf. Sci. 2008, 178, 3307–3316. [Google Scholar] [CrossRef]
- Sun, S.; Yan, T.; Sun, Y.; Yan, M. Computing the 2-Adic complexity of two classes generalized cyclotomic sequences. IEEE Access 2020, 8, 140478–140485. [Google Scholar] [CrossRef]
- Stamp, M.; Martin, C.F. An algorithm for the k-error linear complexity of binary sequences with period 2n. IEEE Trans. Inf. Theory 1993, 39, 1398–1401. [Google Scholar] [CrossRef]
- Wu, C.; Edemskiy, V.; Xu, C. On k-error linear complexity of binary sequences derived from Euler quotients modulo 2p. IEEE Access 2020, 8, 51477–51481. [Google Scholar] [CrossRef]
- Su, M.; Chen, L. The properties of the 1-error linear complexity of pn-periodic sequences over Fp. In Proceedings of the ISIT 2006, Seattle, WA, USA, 9–14 July 2006; pp. 1998–2002. [Google Scholar]
- Zhou, Y.; Han, Y.; Ding, Y. On the k-error linear complexity of sequences from function fields. Bull. Aust. Math. Soc. 2020, 102, 342–352. [Google Scholar] [CrossRef]
- Zhou, J.; Liu, W. On the k-error linear complexity for 2n-periodic sequences via cube theory. arxiv 2013, arXiv:1309.1829. [Google Scholar]
- Chang, Z.; Ke, P. On the error linear complexity spectrum of binary sequences with period of power of two. Chin. J. Electron. 2015, 24, 366–372. [Google Scholar] [CrossRef]
- Xiao, Z.; Zeng, X.; Li, C.; Helleseth, T. New generalized cyclotomic binary sequences of period p2. Des. Codes Cryptog. 2018, 86, 1483–1497. [Google Scholar] [CrossRef]
- Wu, C.; Xu, C.; Chen, Z.; Ke, P. On error linear complexity of new generalized cyclotomic binary sequences of period p2. Inform. Process Lett. 2019, 144, 9–15. [Google Scholar] [CrossRef]
- Alecu, A.; Sălăgean, A. An approximation algorithm for computing the k-error linear complexity of sequences using the discrete fourier transform. In Proceedings of the ISIT 2008, Toronto, ON, Canada, 6–11 July 2008; pp. 2414–2418. [Google Scholar]
- Chen, Z.; Wu, C. k-error linear complexity of binary cyclotomic generators. J. Commun. 2019, 40, 197–206. (In Chinese) [Google Scholar]
- Edemskiy, V.; Wu, C.; Xu, C. Improvements on k-error linear complexity of q-ary sequences derived from Euler quotients. Cryptologia 2022, 46, 148–166. [Google Scholar] [CrossRef]
- Yan, T.; Pazilaiti, A.; Du, L. On the 1-error linear complexity of two-prime generator. AIMS Math. 2022, 7, 5821–5829. [Google Scholar] [CrossRef]
- Whiteman, A.L. A family of difference sets. Ill. J. Math. 1962, 6, 107–121. [Google Scholar] [CrossRef]
- Ding, C.; Helleseth, T. New generalized cyclotomy and its applications. Finite Fields Their Appl. 1998, 4, 140–166. [Google Scholar] [CrossRef]
- Blahut, R.E. Transform techniques for error control codes. IBM J. Res. Dev. 1979, 23, 299–315. [Google Scholar] [CrossRef]
- MacWilliams, F.J.; Sloane, N.J.A. The Theory of Error-Correcting Codes; North-Holland: Amsterdam, The Netherlands, 1977. [Google Scholar]
- Yang, M.; Zhu, S. The distribution functions for the linear complexity of periodic sequences. J. Electron. (China) 2012, 29, 211–214. [Google Scholar] [CrossRef]
- Ding, C.; Helleseth, T. On the linear complexity of legendre sequences. IEEE Trans. Inf. Theory 1999, 44, 1276–1278. [Google Scholar] [CrossRef]
- Yan, T. Linear complexity of ding-helleseth generalized cyclotomic binary sequences of any order. J. Conv. Infor. Tech. 2012, 7, 1849–1853. [Google Scholar]
- Ding, C. Linear complexity of the generalized cyclotomic sequence of order 2. Finite Fields Their Appl. 1997, 3, 159–174. [Google Scholar] [CrossRef]
(−3,3) | (1,3) | ||
(3,−3) | (−1,−3) | ||
(3,3) | (−1,3) | ||
(−3,−1) | (−1,1) | ||
(3,1) | (1,−1) | ||
(3,−1) | (−1,−1) |
(−3,3) | (1,3) | ||
(3,−3) | (−1,−3) | ||
(3,3) | (−1,3) | ||
(−3,−1) | (−1,1) | ||
(3,1) | (1,−1) | ||
(3,−1) | (−1,−1) |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
Yan, C.; Tian, C. On the Stability of the Linear Complexity of Some Generalized Cyclotomic Sequences of Order Two. Mathematics 2024, 12, 2483. https://doi.org/10.3390/math12162483
Yan C, Tian C. On the Stability of the Linear Complexity of Some Generalized Cyclotomic Sequences of Order Two. Mathematics. 2024; 12(16):2483. https://doi.org/10.3390/math12162483
Chicago/Turabian StyleYan, Chi, and Chengliang Tian. 2024. "On the Stability of the Linear Complexity of Some Generalized Cyclotomic Sequences of Order Two" Mathematics 12, no. 16: 2483. https://doi.org/10.3390/math12162483