{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:09Z","timestamp":1772283549680,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,1,5]],"date-time":"2011-01-05T00:00:00Z","timestamp":1294185600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s10623-010-9474-9","type":"journal-article","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T00:52:39Z","timestamp":1294102359000},"page":"251-260","source":"Crossref","is-referenced-by-count":32,"title":["About computation of the linear complexity of generalized cyclotomic sequences with period p n+1"],"prefix":"10.1007","volume":"61","author":[{"given":"Vladimir","family":"Edemskiy","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,1,5]]},"reference":[{"key":"9474_CR1","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1006\/ffta.1998.0207","volume":"4","author":"C. Ding","year":"1998","unstructured":"Ding C., Helleseth T.: New generalized cyclotomy and its applications. Finite Fields Appl. 4, 140\u2013166 (1998)","journal-title":"Finite Fields Appl."},{"key":"9474_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1779-2","volume-title":"A Classical Introduction to Modern Number Theory","author":"K. Ireland","year":"1982","unstructured":"Ireland K., Rosen M.: A Classical Introduction to Modern Number Theory. Springer, Berlin (1982)"},{"issue":"4","key":"9474_CR3","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1142\/S021819679800020X","volume":"8","author":"C. Ding","year":"1998","unstructured":"Ding C.: Linear complexity of some generalized cyclotomic sequences. Int. J. Algebra Comput. 8(4), 431\u2013442 (1998)","journal-title":"Int. J. Algebra Comput."},{"issue":"4","key":"9474_CR4","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1142\/S0218196704001827","volume":"14","author":"Y.H. Park","year":"2004","unstructured":"Park Y.H., Hong D., Chun E.: On the linear complexity of some generalized cyclotomic sequences. Int. J. Algebra Comput. 14(4), 431\u2013439 (2004)","journal-title":"Int. J. Algebra Comput."},{"issue":"3","key":"9474_CR5","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/s11390-007-9042-6","volume":"22","author":"E. Bai","year":"2007","unstructured":"Bai E., Liu X.: Some notes on prime-square sequences. J. Comput. Sci. Technol. 22(3), 481\u2013486 (2007)","journal-title":"J. Comput. Sci. Technol."},{"key":"9474_CR6","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1093\/ietfec\/e90-a.4.857","volume":"E90A","author":"T. Yan","year":"2007","unstructured":"Yan T., Sun R., Xiao G.: Autocorrelation and linear complexity of the new generalized cyclotomic sequences. IEICE Trans. Fund. Electron. E E90A, 857\u2013864 (2007)","journal-title":"IEICE Trans. Fund. Electron. E"},{"key":"9474_CR7","unstructured":"Kim Y.-J., Jin S.-Y., Song H.-Y.: Linear complexity and autocorrelation of prime cube sequences. In: Lecture Notes in Computer Science, vol. 4851, pp. 188\u2013197. Springer, Berlin (2007)."},{"key":"9474_CR8","unstructured":"Kim Y.J., Song H.Y.: Linear complexity of prime n-square sequences. In: IEEE International Symposium on Information Theory, Toronto, Canada, pp. 2405\u20132408 (2008)."},{"key":"9474_CR9","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.aml.2007.03.011","volume":"21","author":"T. Yan","year":"2008","unstructured":"Yan T., Li S., Xiao G.: On the linear complexity of generalized cyclotomic sequences with the period p m . Appl. Math. Lett. 21, 187\u2013193 (2008)","journal-title":"Appl. Math. Lett."},{"key":"9474_CR10","volume-title":"Combinatorial Theory","author":"M. Hall","year":"1975","unstructured":"Hall M.: Combinatorial Theory. Wiley, New York (1975)"},{"key":"9474_CR11","volume-title":"Stream Ciphers and Number Theory","author":"T.W. Cusick","year":"1998","unstructured":"Cusick T.W., Ding C., Renvall A.: Stream Ciphers and Number Theory. North-Holland Publishing Co., Amsterdam (1998)"},{"key":"9474_CR12","doi-asserted-by":"crossref","first-page":"2094","DOI":"10.1109\/18.930950","volume":"47","author":"J.H. Kim","year":"2001","unstructured":"Kim J.H., Song H.Y.: On the linear complexity of Hall\u2019s sextic residue sequences. IEEE Trans. Inform. Theory 47, 2094\u20132096 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9474_CR13","unstructured":"Lidl R., Neid H.: Finite Fields (Encyclopedia of Mathematics and Its Applications), vol. 20. Reading, MA: Addison-Wesley (1983)."},{"key":"9474_CR14","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1109\/18.669398","volume":"44","author":"C. Ding","year":"1998","unstructured":"Ding C., Helleseth T., Shan W.: On the linear complexity of Legendre sequences. IEEE Trans. Inform. Theory 44, 1276\u20131278 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9474_CR15","unstructured":"Edemskii V.A.: On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes. Discret. Math. Appl. 20(1), 75\u201384 (2010) (Diskretn. Mat. 22(1), 74\u201382 (2010))."},{"key":"9474_CR16","unstructured":"Edemskiy V.A.: Linear complexity of ternary sequences formed on the basis of power residue classes. Probl. Inform. Transm. 44(4), 287\u2013294 (2008) (Probl. Peredachi Inform. 44(4), 3\u201311 (2008))."},{"key":"9474_CR17","doi-asserted-by":"crossref","first-page":"2606","DOI":"10.1109\/18.796414","volume":"45","author":"C. Ding","year":"1999","unstructured":"Ding C., Helleseth T., Lam K.Y.: Several classes of binary sequences with three-level autocorrelation. IEEE Trans. Inform. Theory 45, 2606\u20132612 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9474_CR18","unstructured":"Dai Z.D., Gong G., Song H.Y.: Trace representation and linear complexity of binary e-th residue sequences. In: Proceedings of International Workshop on Coding and Cryptography (WCC2003), 24\u201328 March 2003, Versailles, France, pp. 121\u2013133."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9474-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-010-9474-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9474-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:29Z","timestamp":1559246309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-010-9474-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,5]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["9474"],"URL":"https:\/\/doi.org\/10.1007\/s10623-010-9474-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,5]]}}}