{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:15Z","timestamp":1725663495261},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540541950"},{"type":"electronic","value":"9783540474890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54195-0_41","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:37:14Z","timestamp":1330191434000},"page":"86-95","source":"Crossref","is-referenced-by-count":1,"title":["Feasible calculation of the generator for combined LFSR sequences"],"prefix":"10.1007","author":[{"given":"Lu","family":"Peizhong","sequence":"first","affiliation":[]},{"given":"Song","family":"Guowen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0021-8693(73)90170-1","volume":"27","author":"N. Zierler","year":"1973","unstructured":"N. Zierler and W. H. Mills, Products of Linear Recurring Sequences, Journal of Algebra, vol 27, 147\u2013157 (1973)","journal-title":"Journal of Algebra"},{"key":"8_CR2","unstructured":"R. Lidl, Finite Fields, Addison Wesley, 1983"},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/TIT.1987.1057268","volume":"33","author":"R. A. Rueppel","year":"1987","unstructured":"R. A. Rueppel and O. J. Staffelbach, Products of Linear Recurring Sequences with Maximum Complexity. IEEE Trans. IT, vol33, pp124\u2013131, 1987.","journal-title":"IEEE Trans. IT"},{"key":"8_CR4","unstructured":"S. M. Jennings, Multiplexed Sequences:Some Properties of the minimun polynomial. Crypoto'83"},{"key":"8_CR5","unstructured":"N. Jacobson, Basic Algebra II, W. H. Freeman and Company, 1980."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54195-0_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:20:14Z","timestamp":1619558414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54195-0_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540541950","9783540474890"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-54195-0_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}