{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T19:21:12Z","timestamp":1777317672438,"version":"3.51.4"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319200859","type":"print"},{"value":"9783319200866","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20086-6_24","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T08:27:10Z","timestamp":1434702430000},"page":"315-326","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Huffman Codes versus Augmented Non-Prefix-Free Codes"],"prefix":"10.1007","author":[{"given":"Boran","family":"Ada\u015f","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ersin","family":"Bayraktar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. O\u011fuzhan","family":"K\u00fclekci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"24_CR1","unstructured":"Claude, F., Navarro, G.: Space efficient data structures. In: Tutorial Presented at International Symposium on String Processing and Information Retrieval (SPIRE), November 2012"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Dalai, M., Leonardi, R.: Non prefix-free codes for constrained sequences. In: Proceedings of International Symposium on Information Theory (ISIT), pp. 1534\u20131538 (2005)","DOI":"10.1109\/ISIT.2005.1523601"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Fenwick, P.: Lossless Compression Handbook, chapter 3, pp. 55\u201378. Academic Press (2003)","DOI":"10.1016\/B978-012620861-0\/50004-8"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Gonz\u00e1lez, R., Navarro, G., Venturini, R.: Compressed text indexes: From theory to practice. Journal of Experimental Algorithmics (JEA), 13:12 (2009)","DOI":"10.1145\/1412228.1455268"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/978-3-319-07959-2_28","volume-title":"Experimental Algorithms","author":"S Gog","year":"2014","unstructured":"Gog, S., Beller, T., Moffat, A., Petri, M.: From theory to practice: plug and play with succinct data structures. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 326\u2013337. Springer, Heidelberg (2014)"},{"key":"24_CR6","unstructured":"Grossi, R., Gupta, A., Vitter, J.S: High-order entropy-compressed text indexes. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 841\u2013850 (2003)"},{"issue":"9","key":"24_CR7","first-page":"1098","volume":"40","author":"DA Huffman","year":"1952","unstructured":"Huffman, D.A.: A method for the construction of minimum-redundancy codes. Proceedings of the Institute of Radio Engineers 40(9), 1098\u20131101 (1952)","journal-title":"Proceedings of the Institute of Radio Engineers"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Kulekci, M.O.: Uniquely decodable and directly accessible non-prefix-free codes via wavelet trees. In: 2013 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 1969\u20131973, July 2013","DOI":"10.1109\/ISIT.2013.6620570"},{"key":"24_CR9","first-page":"362","volume":"2014","author":"MO Kulekci","year":"2014","unstructured":"Kulekci, M.O.: Enhanced variable-length codes: Improved compression with efficient random access. Data Compression Conference (DCC) 2014, 362\u2013371 (2014)","journal-title":"Data Compression Conference (DCC)"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Okanohara, D., Sadakane, K.: Practical entropy-compressed rank\/select dictionary. In: ALENEX. SIAM (2007)","DOI":"10.1137\/1.9781611972870.6"},{"key":"24_CR11","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 233\u2013242 (2002)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20086-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T12:49:08Z","timestamp":1675860548000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20086-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200859","9783319200866"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20086-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}