{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T03:13:30Z","timestamp":1773112410826,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,11,1]],"date-time":"1982-11-01T00:00:00Z","timestamp":404956800000},"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":11216,"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":[[1982,11]]},"DOI":"10.1016\/0097-3165(82)90038-3","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T04:49:18Z","timestamp":1108010958000},"page":"233-246","source":"Crossref","is-referenced-by-count":95,"title":["On the complexities of de Bruijn sequences"],"prefix":"10.1016","volume":"33","author":[{"given":"Agnes Hui","family":"Chan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard A","family":"Games","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edwin L","family":"Key","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(82)90038-3_BIB1","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"de Bruijn","year":"1946"},{"key":"10.1016\/0097-3165(82)90038-3_BIB2","first-page":"107","article-title":"Solution to question nr. 48","volume":"1","author":"Flye Sainte-Marie","year":"1894","journal-title":"l'Interm\u00e9diaire des Math\u00e9maticiens"},{"key":"10.1016\/0097-3165(82)90038-3_BIB3","article-title":"A fast algorithm for determining the complexity of a binary sequence with period 2n","author":"Games","year":"1982","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0097-3165(82)90038-3_BIB4","series-title":"Shift Register Sequences","author":"Golomb","year":"1967"},{"key":"10.1016\/0097-3165(82)90038-3_BIB5","first-page":"167","article-title":"Normal recurring decimals","volume":"21","author":"Good","year":"1947","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0097-3165(82)90038-3_BIB6","doi-asserted-by":"crossref","first-page":"732","DOI":"10.1109\/TIT.1976.1055626","article-title":"An analysis of the structure and complexity of nonlinear binary sequence generators","author":"Key","year":"1976","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0097-3165(82)90038-3_BIB7","first-page":"1","article-title":"Three approaches to the quantitative definition of information","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0097-3165(82)90038-3_BIB8","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/T-C.1970.222859","article-title":"On a homomorphism of the de Bruijn graph and its applications to the design of feedback shift registers","author":"Lempel","year":"1970","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0097-3165(82)90038-3_BIB9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","article-title":"On the complexity of finite sequences","author":"Lempel","year":"1976","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0097-3165(82)90038-3_BIB10","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","article-title":"The definition of random sequences","volume":"9","author":"Martin-L\u00f6f","year":"1966","journal-title":"Inform. and Contr."},{"key":"10.1016\/0097-3165(82)90038-3_BIB11","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","article-title":"Shift registers synthesis and BCH decoding","author":"Massey","year":"1969","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0097-3165(82)90038-3_BIB12","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/S0019-9958(79)90708-3","article-title":"On the cycle structure of some nonlinear shift register sequences","volume":"43","author":"Mykkeltveit","year":"1979","journal-title":"Inform. Control"},{"key":"10.1016\/0097-3165(82)90038-3_BIB13","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0012-365X(80)90178-8","article-title":"Generation of some de Bruijn sequences","volume":"31","author":"Siu","year":"1980","journal-title":"Discrete Math."}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316582900383?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316582900383?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T08:54:41Z","timestamp":1548752081000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316582900383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,11]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,11]]}},"alternative-id":["0097316582900383"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(82)90038-3","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1982,11]]}}}