{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T11:03:06Z","timestamp":1711710186378},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5645,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1006\/jcta.1997.2822","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T16:59:59Z","timestamp":1034009999000},"page":"140-148","source":"Crossref","is-referenced-by-count":4,"title":["Characterising the Linear Complexity of Span 1 de Bruijn Sequences over Finite Fields"],"prefix":"10.1006","volume":"81","author":[{"given":"Peter A.","family":"Hines","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1006\/jcta.1997.2822_TA972822RF1","series-title":"Classic Papers in Combinatorics","first-page":"203","article-title":"Circuits and trees in oriented linear graphs","author":"Van Ardenne Ehrenfest","year":"1987"},{"key":"10.1006\/jcta.1997.2822_TA972822RF2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1006\/jcta.1996.0088","article-title":"Permutation Polynomials, de Bruijn Sequences, and Linear Complexity","volume":"76","author":"Blackburn","year":"1996","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1006\/jcta.1997.2822_TA972822RF3","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1006\/jcta.1997.2822_TA972822RF4","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"de Bruijn","year":"1946","journal-title":"Proc. Kon. Nederl. Akad. Wetensch."},{"key":"10.1006\/jcta.1997.2822_TA972822RF5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0012-365X(92)90546-R","article-title":"Some VLSI decompositions of the de Bruijn graph","volume":"106\/107","author":"Dolinar","year":"1992","journal-title":"Discrete Math."},{"key":"10.1006\/jcta.1997.2822_TA972822RF6","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0097-3165(82)90038-3","article-title":"On the complexities of de Bruijn sequences","volume":"33","author":"Chan","year":"1982","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1006\/jcta.1997.2822_TA972822RF7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0097-3165(85)90074-3","article-title":"On the distribution of de Bruijn sequences of low complexity","volume":"38","author":"Etzion","year":"1985","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1006\/jcta.1997.2822_TA972822RF8","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1109\/TIT.1984.1056933","article-title":"On the distribution of de Bruijn sequences of given complexity","volume":"30","author":"Etzion","year":"1984","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1006\/jcta.1997.2822_TA972822RF9","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1137\/1024041","article-title":"A survey of full length shift register cycle algorithms","volume":"24","author":"Fredericksen","year":"1982","journal-title":"SIAM Rev."},{"key":"10.1006\/jcta.1997.2822_TA972822RF10","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/0097-3165(83)90060-2","article-title":"There are no de Bruijn sequences of spannn+n+1","volume":"34","author":"Games","year":"1983","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1006\/jcta.1997.2822_TA972822RF11","series-title":"Shift Register Sequences","author":"Golomb","year":"1967"},{"key":"10.1006\/jcta.1997.2822_TA972822RF12","series-title":"Proceedings of EUROCRYPT '87","article-title":"Alternating step generators controlled by de Bruijn sequences","author":"G\u00fcnther","year":"1988"},{"key":"10.1006\/jcta.1997.2822_TA972822RF13","first-page":"1739","article-title":"Linear complexity of binary Golay complementary sequences","volume":"79","author":"Karkkainen","year":"1996","journal-title":"IEICE Trans. Fund. Elect. Comm. and Comp. Sci. A"},{"key":"10.1006\/jcta.1997.2822_TA972822RF14","series-title":"Finite Fields","article-title":"Encyclopedia of mathematics and its applications","author":"Lidl","year":"1983"},{"key":"10.1006\/jcta.1997.2822_TA972822RF15","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1109\/TIT.1969.1054260","article-title":"Shift-register synthesis and BCH decoding","volume":"15","author":"Massey","year":"1969","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1006\/jcta.1997.2822_TA972822RF16","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1109\/18.481790","article-title":"Optimal biphase sequences with large linear complexity derived from sequences overZ","volume":"42","author":"Udaya","year":"1996","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316597928223?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316597928223?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T13:23:10Z","timestamp":1557235390000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097316597928223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0097316597928223"],"URL":"https:\/\/doi.org\/10.1006\/jcta.1997.2822","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}