{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T22:10:02Z","timestamp":1755036602568},"reference-count":5,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"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":7624,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1016\/0012-365x(92)90546-r","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"189-198","source":"Crossref","is-referenced-by-count":13,"special_numbering":"C","title":["Some VLSI decompositions of the de Bruijn graph"],"prefix":"10.1016","volume":"106-107","author":[{"given":"Sam","family":"Dolinar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsz-Mei","family":"Ko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"McEliece","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(92)90546-R_BIB1","unstructured":"O. Collins, S. Dolinar, R. McEliece and F. Pollara, A VLSI decomposition of the de Bruijn Graph, J. Assoc. Comput. Mach., to appear."},{"key":"10.1016\/0012-365X(92)90546-R_BIB2","first-page":"93","article-title":"Wiring Viterbi decoders (splitting de Bruijn graphs)","author":"Collins","year":"1988","journal-title":"JPL TDA Progress Report 42\u201396"},{"year":"1982","series-title":"Shift Register Sequences","author":"Golomb","key":"10.1016\/0012-365X(92)90546-R_BIB3"},{"key":"10.1016\/0012-365X(92)90546-R_BIB4","article-title":"Efficient embeddings and simulations for hypercubic networks","author":"Schwabe","year":"1991","journal-title":"MIT\/LCS\/TR-508"},{"key":"10.1016\/0012-365X(92)90546-R_BIB5","doi-asserted-by":"crossref","unstructured":"S. Dolinar, T.-M. Ko and R. McEliece, VLSI decompositions for de Bruijn graphs, Proc. 1992 International Symp. Circuits and Systems; 1855\u20131858.","DOI":"10.1016\/0012-365X(92)90546-R"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9290546R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9290546R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:50:09Z","timestamp":1555134609000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9290546R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":5,"alternative-id":["0012365X9290546R"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(92)90546-r","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}