乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:01:31Z","timestamp":1648684891230},"reference-count":20,"publisher":"Elsevier BV","issue":"44-46","license":[{"start":{"date-parts":[[2010,10,1]],"date-time":"2010-10-01T00:00:00Z","timestamp":1285891200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,10,25]],"date-time":"2014-10-25T00:00:00Z","timestamp":1414195200000},"content-version":"vor","delay-in-days":1485,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1016\/j.tcs.2010.07.014","type":"journal-article","created":{"date-parts":[[2010,7,28]],"date-time":"2010-07-28T08:41:41Z","timestamp":1280306501000},"page":"3883-3893","source":"Crossref","is-referenced-by-count":3,"title":["The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence"],"prefix":"10.1016","volume":"411","author":[{"given":"Zhi-Han","family":"Gao","sequence":"first","affiliation":[]},{"given":"Fang-Wei","family":"Fu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2010.07.014_br000005","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.tcs.2005.11.044","article-title":"On linear complexity of sequences over GF(2n)","volume":"352","author":"Youssef","year":"2006","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2010.07.014_br000010","series-title":"Stream Ciphers and Number Theory","author":"Cusick","year":"1998"},{"key":"10.1016\/j.tcs.2010.07.014_br000015","series-title":"The Stability Theory of Stream Ciphers","volume":"vol. 561","author":"Ding","year":"1991"},{"key":"10.1016\/j.tcs.2010.07.014_br000020","series-title":"Analysis and Design of Stream Ciphers","author":"Rueppel","year":"1986"},{"key":"10.1016\/j.tcs.2010.07.014_br000025","series-title":"Contemporary Cryptology: The Science of Information Integrity","first-page":"65","article-title":"Stream ciphers","author":"Rueppel","year":"1992"},{"key":"10.1016\/j.tcs.2010.07.014_br000030","series-title":"Finite Fields","author":"Lidl","year":"1983"},{"key":"10.1016\/j.tcs.2010.07.014_br000035","series-title":"Advances in Cryptology-EUROCRYPT 1987","first-page":"37","article-title":"Sequences with almost perfect linear complexity profile","volume":"vol. 304","author":"Niederreiter","year":"1988"},{"key":"10.1016\/j.tcs.2010.07.014_br000040","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1016\/j.ffa.2009.07.002","article-title":"The minimal polynomial over Fq of linear recurring sequence over Fqm","volume":"15","author":"Gao","year":"2009","journal-title":"Finite Fields Appl."},{"key":"10.1016\/j.tcs.2010.07.014_br000045","series-title":"Signal Design for Good Correlation-For Wireless Communication, Cryptography and Radar","author":"Golomb","year":"2005"},{"issue":"8","key":"10.1016\/j.tcs.2010.07.014_br000050","doi-asserted-by":"crossref","first-page":"2501","DOI":"10.1109\/26.310601","article-title":"Synthesis and uniqueness of m-sequences over GF(qn) as n-phase sequences over GF(q)","volume":"42","author":"Gong","year":"1994","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/j.tcs.2010.07.014_br000055","doi-asserted-by":"crossref","first-page":"183","DOI":"10.4064\/aa-61-2-183-181","article-title":"Generating linear spans over finite fields","volume":"61","author":"Chou","year":"1992","journal-title":"Acta Arith."},{"key":"10.1016\/j.tcs.2010.07.014_br000060","first-page":"2254","article-title":"Linear complexity of sequences under different interpretations","volume":"vol. E89-A","author":"Klapper","year":"2006"},{"key":"10.1016\/j.tcs.2010.07.014_br000065","series-title":"Sequences and Their Applications \u2014 SETA 2004","first-page":"101","article-title":"Discrete Fourier transform, joint linear complexity and generalized joint linear complexity of multisequences","volume":"vol. 3486","author":"Meidl","year":"2005"},{"key":"10.1016\/j.tcs.2010.07.014_br000070","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0885-064X(02)00009-2","article-title":"The expected value of the joint linear complexity of periodic multisequences","volume":"19","author":"Meidl","year":"2003","journal-title":"J. Complexity"},{"key":"10.1016\/j.tcs.2010.07.014_br000075","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.jco.2006.10.005","article-title":"Error linear complexity measures for multisequences","volume":"23","author":"Meidl","year":"2007","journal-title":"J. Complexity"},{"key":"10.1016\/j.tcs.2010.07.014_br000080","series-title":"Sequences and Their Applications \u2014 SETA 2008","first-page":"266","article-title":"Generalized joint linear complexity of linear recurring multisequences","volume":"vol. 5203","author":"Meidl","year":"2008"},{"key":"10.1016\/j.tcs.2010.07.014_br000085","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.ffa.2008.09.004","article-title":"Linear complexity over Fq and over Fqm for linear recurring sequences","volume":"15","author":"Meidl","year":"2009","journal-title":"Finite Fields Appl."},{"key":"10.1016\/j.tcs.2010.07.014_br000090","doi-asserted-by":"crossref","first-page":"221","DOI":"10.4064\/aa-65-3-221-226","article-title":"Values of linear recurring sequences of vectors over finite fields","volume":"65","author":"Mullen","year":"1993","journal-title":"Acta Arith."},{"key":"10.1016\/j.tcs.2010.07.014_br000095","series-title":"Progress in Cryptology \u2014 INDOCRYPT 2003","first-page":"1","article-title":"Linear complexity and related complexity measures for sequences","volume":"vol. 2904","author":"Niederreiter","year":"2003"},{"key":"10.1016\/j.tcs.2010.07.014_br000100","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10623-008-9174-x","article-title":"Periodic multisequences with large error linear complexity","volume":"49","author":"Niederreiter","year":"2008","journal-title":"Des. Codes Cryptogr."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397510004007?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397510004007?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T16:03:29Z","timestamp":1559318609000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397510004007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10]]},"references-count":20,"journal-issue":{"issue":"44-46","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["S0304397510004007"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2010.07.014","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2010,10]]}}}