{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:05:00Z","timestamp":1758269100697},"reference-count":8,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0020-0190(01)00243-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:34:32Z","timestamp":1027593272000},"page":"305-308","source":"Crossref","is-referenced-by-count":8,"title":["An efficient decoding technique for Huffman codes"],"prefix":"10.1016","volume":"81","author":[{"given":"Rezaul Alam","family":"Chowdhury","sequence":"first","affiliation":[]},{"given":"M.","family":"Kaykobad","sequence":"additional","affiliation":[]},{"given":"Irwin","family":"King","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00243-5_BIB001","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0020-0190(99)00002-2","article-title":"A memory-efficient and fast Huffman decoding algorithm","volume":"69","author":"Chen","year":"1999","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(01)00243-5_BIB002","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."},{"issue":"10","key":"10.1016\/S0020-0190(01)00243-5_BIB003","doi-asserted-by":"crossref","first-page":"2576","DOI":"10.1109\/26.469442","article-title":"Memory efficient and high-speed search Huffman coding","volume":"43","author":"Hashemian","year":"1995","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/S0020-0190(01)00243-5_BIB004","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","article-title":"A method for construction of minimum redundancy codes","volume":"40","author":"Huffman","year":"1952","journal-title":"Proc. IRE"},{"issue":"3","key":"10.1016\/S0020-0190(01)00243-5_BIB005","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1976.1055554","article-title":"Huffman codes and self-information","volume":"22","author":"Katona","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0020-0190(01)00243-5_BIB006","series-title":"An approach towards development of efficient data compression algorithms and correction techniques, Ph.D. Thesis","author":"Mandal","year":"2000"},{"issue":"4","key":"10.1016\/S0020-0190(01)00243-5_BIB007","doi-asserted-by":"crossref","first-page":"1246","DOI":"10.1109\/18.335944","article-title":"The length of a typical Huffman codeword","volume":"40","author":"Schack","year":"1994","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"10.1016\/S0020-0190(01)00243-5_BIB008","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1145\/31846.42227","article-title":"Design and analysis of dynamic Huffman codes","volume":"34","author":"Vitter","year":"1987","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002435?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002435?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T01:27:40Z","timestamp":1556414860000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002435"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0020019001002435"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00243-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}