{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T20:00:40Z","timestamp":1773086440095,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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":[[1996,7]]},"DOI":"10.1016\/0020-0190(96)00090-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:21:21Z","timestamp":1027606881000},"page":"65-73","source":"Crossref","is-referenced-by-count":10,"title":["Parallel lossless image compression using Huffman and arithmetic coding"],"prefix":"10.1016","volume":"59","author":[{"given":"Paul G.","family":"Howard","sequence":"first","affiliation":[]},{"given":"Jeffrey Scott","family":"Vitter","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00090-7_BIB1","series-title":"Proc. Data Compression Conf.","first-page":"43","article-title":"High efficiency, multiplication free approximation of arithmetic coding","author":"Chevion","year":"1991"},{"key":"10.1016\/0020-0190(96)00090-7_BIB2","series-title":"Proc. Data Compression Conf.","first-page":"52","article-title":"Parallel algorithms for optimal compression using dictionaries with the prefix property","author":"De Agostino","year":"1992"},{"key":"10.1016\/0020-0190(96)00090-7_BIB3","series-title":"Proc. Data Compression Conf.","first-page":"118","article-title":"Minimizing error and VLSI complexity in the multiplication free approximation of arithmetic coding","author":"Feygin","year":"1993"},{"issue":"3","key":"10.1016\/0020-0190(96)00090-7_BIB4","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1109\/TIT.1975.1055357","article-title":"Optimal source codes for geometrically distributed integer alphabets","volume":"21","author":"Gallager","year":"1975","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"10.1016\/0020-0190(96)00090-7_BIB5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1137\/0203008","article-title":"Optimal binary search trees with restricted maximum depth","volume":"3","author":"Garey","year":"1974","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/0020-0190(96)00090-7_BIB6","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/TIT.1966.1053907","article-title":"Run-length encodings","volume":"12","author":"Golomb","year":"1966","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0020-0190(96)00090-7_BIB7","series-title":"Coding and Information Theory","author":"Hamming","year":"1980"},{"issue":"6","key":"10.1016\/0020-0190(96)00090-7_BIB8","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1016\/0306-4573(92)90067-A","article-title":"New methods for lossless image compression using arithmetic coding","volume":"28","author":"Howard","year":"1992","journal-title":"Inform. Process. Management"},{"key":"10.1016\/0020-0190(96)00090-7_BIB9","series-title":"Image and Text Compression","first-page":"85","article-title":"Practical implementations of arithmetic coding","author":"Howard","year":"1992"},{"issue":"6","key":"10.1016\/0020-0190(96)00090-7_BIB10","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1016\/0306-4573(94)90006-X","article-title":"Design and analysis of fast text compression based on quasi-arithmetic coding","volume":"30","author":"Howard","year":"1994","journal-title":"Inform. Process. Management"},{"key":"10.1016\/0020-0190(96)00090-7_BIB11","series-title":"Image and Video Compression Conf., Symp. on Electronic Imaging: Science and Technology, SPIE-2186","first-page":"98","article-title":"Fast progressive lossless image compression","author":"Howard","year":"1994"},{"key":"10.1016\/0020-0190(96)00090-7_BIB12","first-page":"857","article-title":"Arithmetic coding for data compression","volume":"82","author":"Howard","year":"1994"},{"key":"10.1016\/0020-0190(96)00090-7_BIB13","series-title":"Proc. Data Compression Conf.","first-page":"269","article-title":"Error modeling for hierarchical lossless image compression","author":"Howard","year":"1992"},{"key":"10.1016\/0020-0190(96)00090-7_BIB14","article-title":"A hybrid algorithm for compression of infrared images of space","author":"Huber","year":"1993"},{"key":"10.1016\/0020-0190(96)00090-7_BIB15","first-page":"1098","article-title":"A method for the construction of minimum redundancy codes","volume":"40","author":"Huffman","year":"1952"},{"key":"10.1016\/0020-0190(96)00090-7_BIB16","series-title":"Proc. Data Compression Conf.","first-page":"202","article-title":"Arithmetic coding revisited","author":"Moffat","year":"1995"},{"key":"10.1016\/0020-0190(96)00090-7_BIB17","series-title":"Proc. Data Compression Conf.","first-page":"128","article-title":"Multialphabet arithmetic coding at 16 MBytes\/sec","author":"Printz","year":"1993"},{"key":"10.1016\/0020-0190(96)00090-7_BIB18","article-title":"Some practical universal noiseless coding techniques","author":"Rice","year":"1979"},{"issue":"2","key":"10.1016\/0020-0190(96)00090-7_BIB19","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/26.20074","article-title":"A multiplication-free multialphabet arithmetic code","volume":"37","author":"Rissanen","year":"1989","journal-title":"IEEE Trans. Comm."},{"issue":"2","key":"10.1016\/0020-0190(96)00090-7_BIB20","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1109\/TIT.1974.1055176","article-title":"Constructing codes with bounded codeword lengths","volume":"20","author":"Van Voorhis","year":"1974","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"10.1016\/0020-0190(96)00090-7_BIB21","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1145\/214762.214771","article-title":"Arithmetic coding for data compression","volume":"30","author":"Witten","year":"1987","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000907?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000907?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:24:14Z","timestamp":1556043854000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096000907"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0020019096000907"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00090-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}