{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T18:59:03Z","timestamp":1761418743743},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s11786-011-0067-4","type":"journal-article","created":{"date-parts":[[2011,9,15]],"date-time":"2011-09-15T22:41:05Z","timestamp":1316126465000},"page":"171-178","source":"Crossref","is-referenced-by-count":5,"title":["Huffman Coding with Non-Sorted Frequencies"],"prefix":"10.1007","volume":"5","author":[{"given":"Shmuel T.","family":"Klein","sequence":"first","affiliation":[]},{"given":"Dana","family":"Shapira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,9,16]]},"reference":[{"key":"67_CR1","unstructured":"Ahlswede, R.: Identification entropy. In: Information Transfer and Combinatorics. LNCS, vol. 4123, pp. 595\u2013613 (2006)"},{"key":"67_CR2","doi-asserted-by":"crossref","unstructured":"Brisaboa, N.R., Fari\u00f1a, A., Navarro, G., Esteller, M.F.: (s, c)-dense coding: an optimized compression code for natural language text databases. In: Proc. Symposium on String Processing and Information Retrieval SPIRE\u201903, LNCS, vol. 2857, pp. 122\u2013136 (2003)","DOI":"10.1007\/978-3-540-39984-1_10"},{"key":"67_CR3","unstructured":"Brisaboa, N.R., Iglesias, E.L, Navarro, G., Param\u00e1, J.R: An efficient compression code for text databases. In: Proc. European Conference on Information Retrieval ECIR\u201903, LNCS, vol. 2633, pp. 468\u2013481 (2003)"},{"key":"67_CR4","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical Report SRC 124, Digital Systems Research Center (1994)"},{"key":"67_CR5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/348751.348754","volume":"18","author":"E.S. Moura de","year":"2000","unstructured":"de oura E.S., Navarro G., Ziviani N., Baeza-Yates R.: Fast and flexible word searching on compressed text. ACM Trans. Inf. Syst. 18, 113\u2013139 (2000)","journal-title":"ACM Trans. Inf. Syst."},{"key":"67_CR6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0166-218X(93)00116-H","volume":"64","author":"A.S. Fraenkel","year":"1996","unstructured":"Fraenkel A.S., Klein S.T.: Robust universal complete codes for transmission and compression. Discrete Appl. Math. 64, 31\u201355 (1996)","journal-title":"Discrete Appl. Math."},{"key":"67_CR7","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1137\/0131030","volume":"31","author":"C.R. Glassey","year":"1976","unstructured":"Glassey C.R., Karp R.M.: On the optimality of Huffman trees. SIAM J. Appl. Math. 31, 368\u2013378 (1976)","journal-title":"SIAM J. Appl. Math."},{"key":"67_CR8","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D. Huffman","year":"1952","unstructured":"Huffman D.: A method for the construction of minimum redundancy codes. Proc. IRE 40, 1098\u20131101 (1952)","journal-title":"Proc. IRE"},{"key":"67_CR9","first-page":"284","volume":"IT\u201311","author":"G.H.O. Katona","year":"1965","unstructured":"Katona G.H.O., Nemetz T.O.H.: Huffman codes and self-information. IEEE Trans. Inf. Theory IT\u201311, 284\u2013292 (1965)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"67_CR10","doi-asserted-by":"crossref","unstructured":"Klein, S.T., Kopel Ben-Nissan, M.: Using Fibonacci compression codes as alternatives to dense codes. In: Proc. Data Compression Conference DCC-2008, pp. 472\u2013481 (2008)","DOI":"10.1109\/DCC.2008.54"},{"key":"67_CR11","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S. Kullback","year":"1951","unstructured":"Kullback S., Leibler R.A.: On information and sufficency. Ann. Math. Stat. 22, 79\u201386 (1951)","journal-title":"Ann. Math. Stat."},{"key":"67_CR12","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1109\/TIT.1982.1056452","volume":"IT\u201328","author":"G. Longo","year":"1982","unstructured":"Longo G., Galasso G.: An application of informational divergence to Huffman codes. IEEE Trans. Inf. Theory IT\u201328, 36\u201343 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"67_CR13","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1137\/0209035","volume":"9","author":"D.S. Parker Jr","year":"1980","unstructured":"Parker D.S. Jr: Conditions for the optimality of the Huffman algorithm. SIAM J. Comput. 9, 470\u2013489 (1980)","journal-title":"SIAM J. Comput."},{"key":"67_CR14","unstructured":"Van Leeuwen, J.: On the construction of Huffman trees. In: Proc. 3rd ICALP Conference, pp. 382\u2013410 (1976)"},{"key":"67_CR15","doi-asserted-by":"crossref","unstructured":"V\u00e9ronis, J., Langlais, P.: Evaluation of parallel text alignment systems: the ARCADE project. In: V\u00e9ronis, J. (ed.) Parallel Text Processing, pp. 369\u2013388 (2000)","DOI":"10.1007\/978-94-017-2535-4_19"},{"key":"67_CR16","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1145\/214762.214771","volume":"30","author":"I.H. Witten","year":"1987","unstructured":"Witten I.H., Neal R.M., Cleary J.G.: Arithmetic coding for data compression. Commun. ACM 30, 520\u2013540 (1987)","journal-title":"Commun. ACM"},{"key":"67_CR17","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(75)90056-3","volume":"4","author":"A.C.C. Yao","year":"1975","unstructured":"Yao A.C.C.: An O(|E| log log |V|) algorithm for finding minimum spanning trees. Inf. Process. Lett. 4, 21\u201323 (1975)","journal-title":"Inf. Process. Lett."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-011-0067-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-011-0067-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-011-0067-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T17:08:55Z","timestamp":1560618535000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-011-0067-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["67"],"URL":"https:\/\/doi.org\/10.1007\/s11786-011-0067-4","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}