乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T15:22:56Z","timestamp":1699975376458},"reference-count":27,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2007,4,1]],"date-time":"2007-04-01T00:00:00Z","timestamp":1175385600000},"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":[[2007,4]]},"DOI":"10.1016\/j.ipl.2006.09.015","type":"journal-article","created":{"date-parts":[[2006,12,2]],"date-time":"2006-12-02T09:24:15Z","timestamp":1165051455000},"page":"113-117","source":"Crossref","is-referenced-by-count":5,"title":["Dynamic Shannon coding"],"prefix":"10.1016","volume":"102","author":[{"given":"Travis","family":"Gagie","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ipl.2006.09.015_bib001","first-page":"1259","article-title":"An algorithm for the organization of information","volume":"3","author":"Adelson-Velsky","year":"1962","journal-title":"Soviet Mathematics"},{"key":"10.1016\/j.ipl.2006.09.015_bib002","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1006\/jagm.2002.1213","article-title":"Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property","volume":"42","author":"Bradford","year":"2002","journal-title":"Journal of Algorithms"},{"key":"10.1016\/j.ipl.2006.09.015_bib003","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1006\/jpdc.2000.1717","article-title":"The sound of silence: Guessing games for saving energy in a mobile environment","volume":"61","author":"Dolev","year":"2001","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/j.ipl.2006.09.015_bib004","doi-asserted-by":"crossref","unstructured":"M. Drmota, W. Szpankowski, Generalized Shannon code minimizes the maximal redundancy, in: Proceedings of the 5th Latin American Symposium on Theoretical Informatics, 2002, pp. 306\u2013318","DOI":"10.1007\/3-540-45995-2_29"},{"key":"10.1016\/j.ipl.2006.09.015_bib005","unstructured":"N. Faller, An adaptive system for data compression, in: Proceedings of the 7th Asilomar Conference on Circuits, Systems, and Computers, 1973, pp. 593\u2013597"},{"key":"10.1016\/j.ipl.2006.09.015_bib006","doi-asserted-by":"crossref","unstructured":"T. Gagie, Dynamic Shannon coding, in: Proceedings of the 12th European Symposium on Algorithms, 2004, pp. 359\u2013370","DOI":"10.1007\/978-3-540-30140-0_33"},{"key":"10.1016\/j.ipl.2006.09.015_bib007","doi-asserted-by":"crossref","unstructured":"T. Gagie, Dynamic asymmetric communication, in: Proceedings of the 13th Colloquium on Structural Information and Communication Complexity, 2006, pp. 310\u2013318","DOI":"10.1007\/11780823_24"},{"key":"10.1016\/j.ipl.2006.09.015_bib008","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1109\/TIT.1978.1055959","article-title":"Variations on a theme by Huffman","volume":"24","author":"Gallager","year":"1978","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/j.ipl.2006.09.015_bib009","doi-asserted-by":"crossref","unstructured":"M.J. Golin, C. Kenyon, N.E. Young, Huffman coding with unequal letter costs, in: Proceedings of the 34th Symposium on Theory of Computing, 2002, pp. 785\u2013791","DOI":"10.1145\/510019.510020"},{"key":"10.1016\/j.ipl.2006.09.015_bib010","doi-asserted-by":"crossref","first-page":"1770","DOI":"10.1109\/18.705558","article-title":"A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs","volume":"44","author":"Golin","year":"1998","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/j.ipl.2006.09.015_bib011","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1016\/0306-4573(92)90067-A","article-title":"Analysis of arithmetic coding for data compression","volume":"28","author":"Howard","year":"1992","journal-title":"Information Processing and Management"},{"key":"10.1016\/j.ipl.2006.09.015_bib012","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","article-title":"A method for the construction of minimum-redundancy codes","volume":"40","author":"Huffman","year":"1952","journal-title":"Proceedings of the IERE"},{"key":"10.1016\/j.ipl.2006.09.015_bib013","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/TIT.1961.1057615","article-title":"Minimum-redundancy coding for the discrete noiseless channel","volume":"7","author":"Karp","year":"1961","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/j.ipl.2006.09.015_bib014","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":"1976","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/j.ipl.2006.09.015_bib015","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\/j.ipl.2006.09.015_bib016","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0019-9958(62)90183-3","article-title":"Channels which transmit letters of unequal duration","volume":"5","author":"Krause","year":"1962","journal-title":"Information and Control"},{"key":"10.1016\/j.ipl.2006.09.015_bib017","unstructured":"M. Liddell, A. Moffat, Length-restricted coding in static and dynamic frameworks, in: Proceedings of the IEEE Data Compression Conference, 2001, pp. 133\u2013142"},{"key":"10.1016\/j.ipl.2006.09.015_bib018","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1145\/382780.382782","article-title":"An analysis of the Burrows\u2013Wheeler transform","volume":"48","author":"Manzini","year":"2001","journal-title":"Journal of the ACM"},{"key":"10.1016\/j.ipl.2006.09.015_bib019","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1006\/jagm.1999.1012","article-title":"Bounding the compression loss of the FGK algorithm","volume":"32","author":"Milidi\u00fa","year":"1999","journal-title":"Journal of Algorithms"},{"key":"10.1016\/j.ipl.2006.09.015_bib020","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1002\/(SICI)1097-024X(199906)29:7<647::AID-SPE252>3.0.CO;2-5","article-title":"An improved data structure for cumulative probability tables","volume":"29","author":"Moffat","year":"1999","journal-title":"Software: Practice and Experience"},{"key":"10.1016\/j.ipl.2006.09.015_bib021","series-title":"Compression and Coding Algorithms","author":"Moffat","year":"2002"},{"key":"10.1016\/j.ipl.2006.09.015_bib022","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0205001","article-title":"Sorting and searching in multisets","volume":"5","author":"Munro","year":"1976","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.ipl.2006.09.015_bib023","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\/j.ipl.2006.09.015_bib024","doi-asserted-by":"crossref","first-page":"1656","DOI":"10.1016\/j.ins.2005.07.010","article-title":"A fast and efficient nearly-optimal adaptive Fano coding scheme","volume":"176","author":"Rueda","year":"2006","journal-title":"Information Sciences"},{"key":"10.1016\/j.ipl.2006.09.015_bib025","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0019-9958(64)90241-4","article-title":"An optimum encoding with minimum longest code and total number of digits","volume":"7","author":"Schwartz","year":"1964","journal-title":"Information and Control"},{"key":"10.1016\/j.ipl.2006.09.015_bib026","doi-asserted-by":"crossref","first-page":"379","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 System Technical Journal"},{"key":"10.1016\/j.ipl.2006.09.015_bib027","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":"Journal of the ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019006003292?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019006003292?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T13:53:15Z","timestamp":1555941195000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019006003292"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4]]},"references-count":27,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2007,4]]}},"alternative-id":["S0020019006003292"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2006.09.015","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2007,4]]}}}