{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T19:21:11Z","timestamp":1777317671632,"version":"3.51.4"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620570","type":"proceedings-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T22:57:32Z","timestamp":1381532252000},"page":"1969-1973","source":"Crossref","is-referenced-by-count":6,"title":["Uniquely decodable and directly accessible non-prefix-free codes via wavelet trees"],"prefix":"10.1109","author":[{"given":"M. Oguzhan","family":"Kulekci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","first-page":"233","article-title":"Succinct indexable dictionaries with applications to encoding k-ary trees and multisets","author":"raman","year":"2002","journal-title":"Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.83"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63533"},{"key":"16","first-page":"383","article-title":"Efficient suffix trees on secondary storage","author":"clark","year":"1996","journal-title":"Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"13","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-540-69507-3_19","article-title":"Compressed prefix sums","volume":"4362","author":"delpratt","year":"2007","journal-title":"(SOFSEM 2007 Theory and Practice of Computer Science Ser LNCS"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2010.11.006"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.12.012"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34109-0_22"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.12.002"},{"key":"2","first-page":"2","article-title":"Wavelet trees for all","volume":"7354","author":"navarro","year":"2012","journal-title":"CPM 2012 Combinatorial Pattern Matching Ser LNCS"},{"key":"1","first-page":"841","article-title":"High-order entropy-compressed text indexes","author":"grossi","year":"2003","journal-title":"Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"10","first-page":"178","year":"2008","journal-title":"Compressing Integer Sequences and Sets"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2012.08.003"},{"key":"6","author":"kraft","year":"1949","journal-title":"A device for quantizing grouping and coding amplitude modulated pulses"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012620861-0\/50004-8"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.12.010"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523601"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/42.3.193"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","location":"Istanbul, Turkey","start":{"date-parts":[[2013,7,7]]},"end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620570.pdf?arnumber=6620570","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T19:46:01Z","timestamp":1498074361000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620570\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620570","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}