{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T20:14:59Z","timestamp":1773087299533,"version":"3.50.1"},"reference-count":34,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1992,11,1]],"date-time":"1992-11-01T00:00:00Z","timestamp":720576000000},"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 & Management"],"published-print":{"date-parts":[[1992,11]]},"DOI":"10.1016\/0306-4573(92)90066-9","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T18:05:40Z","timestamp":1034100340000},"page":"749-763","source":"Crossref","is-referenced-by-count":55,"title":["Analysis of arithmetic coding for data compression"],"prefix":"10.1016","volume":"28","author":[{"given":"Paul G.","family":"Howard","sequence":"first","affiliation":[]},{"given":"Jeffrey Scott","family":"Vitter","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0306-4573(92)90066-9_BIB1","first-page":"6292","article-title":"Method for adaptively initializing a source model for symbol encoding","volume":"26","author":"Arps","year":"1984","journal-title":"IBM Technical Disclosure Bulletin"},{"key":"10.1016\/0306-4573(92)90066-9_BIB2","series-title":"Text Compression","author":"Bell","year":"1990"},{"key":"10.1016\/0306-4573(92)90066-9_BIB3","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1145\/76894.76896","article-title":"Modeling for text compression","volume":"21","author":"Bell","year":"1989","journal-title":"Computing Surveys"},{"key":"10.1016\/0306-4573(92)90066-9_BIB4","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1145\/5684.5688","article-title":"A locally adaptive data compression scheme","volume":"29","author":"Bentley","year":"1986","journal-title":"Communications of the ACM"},{"key":"10.1016\/0306-4573(92)90066-9_BIB5","series-title":"Proceedings of the Data Compression Conference","first-page":"43","article-title":"High efficiency, multiplication free approximation of arithmetic coding","author":"Chevion","year":"1991"},{"key":"10.1016\/0306-4573(92)90066-9_BIB6","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1109\/TCOM.1984.1096090","article-title":"Data compression using adaptive coding and partial string matching","volume":"COM-32","author":"Cleary","year":"1984","journal-title":"IEEE Trans. Communications"},{"key":"10.1016\/0306-4573(92)90066-9_BIB7","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1109\/TIT.1984.1056889","article-title":"A comparison of enumerative and adaptive codes","volume":"IT-30","author":"Cleary","year":"1984","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0306-4573(92)90066-9_BIB8","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1093\/comjnl\/30.6.541","article-title":"Data compression using dynamic Markov modelling","volume":"30","author":"Cormack","year":"1987","journal-title":"Computer Journal"},{"key":"10.1016\/0306-4573(92)90066-9_BIB9","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0020-0190(84)90021-8","article-title":"Algorithms for adaptive Huffman codes","volume":"18","author":"Cormack","year":"1984","journal-title":"Information Processing Letters"},{"key":"10.1016\/0306-4573(92)90066-9_BIB10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/TIT.1987.1057251","article-title":"Interval and recency rank source coding: Two on-line adaptive variable length schemes","volume":"IT-33","author":"Elias","year":"1987","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0306-4573(92)90066-9_BIB11","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","article-title":"Universal codeword sets and representations of integers","volume":"IT-21","author":"Elias","year":"1975","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0306-4573(92)90066-9_BIB12","series-title":"Technical report","article-title":"Robust universal complete codes as alternatives to Huffman codes","author":"Fraenkel","year":"1985"},{"key":"10.1016\/0306-4573(92)90066-9_BIB13","series-title":"Proceedings of the International Conference on Advances in Communication and Control (COMCON 3)","article-title":"Practical implementations of Arithmetic coding","author":"Howard","year":"1991"},{"key":"10.1016\/0306-4573(92)90066-9_BIB14","first-page":"1098","article-title":"A method for the construction of minimum redundancy codes","volume":"40","author":"Huffman","year":"1952","journal-title":"Proceedings of the Institute of Radio Engineers"},{"key":"10.1016\/0306-4573(92)90066-9_BIB15","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0196-6774(85)90036-7","article-title":"Dynamic Huffman coding","volume":"6","author":"Knuth","year":"1985","journal-title":"Journal of Algorithms"},{"key":"10.1016\/0306-4573(92)90066-9_BIB16","series-title":"Proceedings of the Data Compression Conference","first-page":"13","article-title":"Probabilistic and Q-coder algorithms for binary source adaptation","author":"Langdon","year":"1991"},{"key":"10.1016\/0306-4573(92)90066-9_BIB17","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1147\/rd.282.0135","article-title":"An introduction to arithmetic coding","volume":"28","author":"Langdon","year":"1984","journal-title":"IBM Journal of Research and Development"},{"key":"10.1016\/0306-4573(92)90066-9_BIB18","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1109\/TCOM.1981.1095052","article-title":"Compression of black-white images with arithmetic coding","volume":"COM-29","author":"Langdon","year":"1981","journal-title":"IEEE Trans. Communications"},{"key":"10.1016\/0306-4573(92)90066-9_BIB19","doi-asserted-by":"crossref","first-page":"1917","DOI":"10.1109\/26.61469","article-title":"Implementing the PPM data compression scheme","volume":"COM-38","author":"Moffat","year":"1990","journal-title":"IEEE Trans. Communications"},{"key":"10.1016\/0306-4573(92)90066-9_BIB20","first-page":"4798","article-title":"Adaptive model for nonstationary sources","volume":"28","author":"Mohiuddin","year":"1986","journal-title":"IBM Technical Disclosure Bulletin"},{"key":"10.1016\/0306-4573(92)90066-9_BIB21","series-title":"Ph.D. Thesis","article-title":"Source coding algorithms for fast data compression","author":"Pasco","year":"1976"},{"key":"10.1016\/0306-4573(92)90066-9_BIB22","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1147\/rd.326.0717","article-title":"An overview of the basic principles of the Q-coder adaptive binary arithmetic coder","volume":"32","author":"Pennebaker","year":"1988","journal-title":"IBM Journal of Research and Development"},{"key":"10.1016\/0306-4573(92)90066-9_BIB23","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1214\/aos\/1176350051","article-title":"Stochastic complexity and modeling","volume":"14","author":"Rissanen","year":"1986","journal-title":"Annals of Statistics"},{"key":"10.1016\/0306-4573(92)90066-9_BIB24","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1111\/j.2517-6161.1987.tb01694.x","article-title":"Stochastic complexity","volume":"49","author":"Rissanen","year":"1987","journal-title":"Journal of the Royal Statistical Society Series B"},{"key":"10.1016\/0306-4573(92)90066-9_BIB25","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1109\/TIT.1984.1056936","article-title":"Universal coding, information, prediction, and estimation","volume":"IT-30","author":"Rissanen","year":"1984","journal-title":"IEEE Transcripts of Information Theory"},{"key":"10.1016\/0306-4573(92)90066-9_BIB26","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1147\/rd.203.0198","article-title":"Generalized Kraft inequality and arithmetic coding","volume":"20","author":"Rissanen","year":"1976","journal-title":"IBM Journal of Research and Development"},{"key":"10.1016\/0306-4573(92)90066-9_BIB27","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. Communications"},{"key":"10.1016\/0306-4573(92)90066-9_BIB28","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1109\/TIT.1979.1056107","article-title":"Arithmetic stream coding using fixed precision registers","volume":"IT-25","author":"Rubin","year":"1979","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0306-4573(92)90066-9_BIB29","article-title":"Data compression by means of a book stack","volume":"16","author":"Ryabko","year":"1980","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1016\/0306-4573(92)90066-9_BIB30","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell Systems Technology Journal"},{"key":"10.1016\/0306-4573(92)90066-9_BIB31","first-page":"310","article-title":"On encoding of commas between strings","volume":"22","author":"Stone","year":"1979","journal-title":"Communications of the ACM"},{"key":"10.1016\/0306-4573(92)90066-9_BIB32","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1109\/18.2643","article-title":"Almost asymptotically optimal flag encoding of the integers","volume":"IT-34","author":"Wang","year":"1988","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0306-4573(92)90066-9_BIB33","doi-asserted-by":"crossref","first-page":"1085","DOI":"10.1109\/18.87000","article-title":"The zero frequency problem: Estimating the probabilities of novel events in adaptive text compression","volume":"IT-37","author":"Witten","year":"1991","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0306-4573(92)90066-9_BIB34","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":"Communications of the ACM"}],"container-title":["Information Processing & Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306457392900669?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306457392900669?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T21:32:40Z","timestamp":1733779960000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0306457392900669"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,11]]},"references-count":34,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,11]]}},"alternative-id":["0306457392900669"],"URL":"https:\/\/doi.org\/10.1016\/0306-4573(92)90066-9","relation":{},"ISSN":["0306-4573"],"issn-type":[{"value":"0306-4573","type":"print"}],"subject":[],"published":{"date-parts":[[1992,11]]}}}