{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T10:11:48Z","timestamp":1758190308304,"version":"3.44.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,4,9]],"date-time":"1999-04-09T00:00:00Z","timestamp":923616000000},"content-version":"vor","delay-in-days":494,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1997,12]]},"DOI":"10.1016\/s0020-0190(97)00176-2","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"271-275","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"title":["An efficient finite-state machine implementation of Huffman decoders"],"prefix":"10.1016","volume":"64","author":[{"given":"Vikram","family":"Iyengar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krishnendu","family":"Chakrabarty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00176-2_BIB1","series-title":"Proc. 1989 Internat. Symp. on Circuits and Systems","first-page":"1929","article-title":"Combinational profiles of sequential benchmark circuits","author":"Brglez","year":"1989"},{"year":"1997","series-title":"Digital Designing with Programmable Logic Devices","author":"Carter","key":"10.1016\/S0020-0190(97)00176-2_BIB2"},{"key":"10.1016\/S0020-0190(97)00176-2_BIB3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0020-0190(96)00204-9","article-title":"Efficient Huffman decoding","volume":"61","author":"Chung","year":"1997","journal-title":"Inform. Process. Lett."},{"year":"1991","series-title":"Elements of Information Theory","author":"Cover","key":"10.1016\/S0020-0190(97)00176-2_BIB4"},{"journal-title":"Epoch Finesse User and Reference Manual","article-title":"Cascade Design Automation","year":"1993","key":"10.1016\/S0020-0190(97)00176-2_BIB5"},{"year":"1996","series-title":"Image and Data Compression","author":"Held","key":"10.1016\/S0020-0190(97)00176-2_BIB6"},{"key":"10.1016\/S0020-0190(97)00176-2_BIB7","first-page":"1442","article-title":"Test set encoding for efficient sequential circuit testing","volume":"vol. 2","author":"Iyengar","year":"1997"},{"issue":"6","key":"10.1016\/S0020-0190(97)00176-2_BIB8","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/0020-0190(78)90023-6","article-title":"Huffman coding in bit-vector compression","volume":"7","author":"Jakobssen","year":"1978","journal-title":"Inform. Process. Lett."},{"year":"1984","author":"Kahan","key":"10.1016\/S0020-0190(97)00176-2_BIB9"},{"year":"1994","series-title":"Field-Programmable Gate Array Technology","key":"10.1016\/S0020-0190(97)00176-2_BIB10"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001762?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001762?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T04:29:22Z","timestamp":1758083362000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097001762"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["S0020019097001762"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00176-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1997,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An efficient finite-state machine implementation of Huffman decoders","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0020-0190(97)00176-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}