{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:33:02Z","timestamp":1773325982054,"version":"3.50.1"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Millennium Nucleus Information and Coordination in Networks","award":["ICM\/FIC RC130003"],"award-info":[{"award-number":["ICM\/FIC RC130003"]}]},{"name":"Millennium Nucleus Information and Coordination in Networks","award":["ICM\/FIC RC130003"],"award-info":[{"award-number":["ICM\/FIC RC130003"]}]},{"name":"MINECO through PGE and FEDER","award":["TIN2013-46238-C4-3-R"],"award-info":[{"award-number":["TIN2013-46238-C4-3-R"]}]},{"name":"MINECO through PGE and FEDER","award":["TIN2013-47090- C3-3-P"],"award-info":[{"award-number":["TIN2013-47090- C3-3-P"]}]},{"DOI":"10.13039\/501100001872","name":"CDTI","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001872","id-type":"DOI","asserted-by":"crossref"}]},{"name":"AGI"},{"name":"MINECO","award":["CDTI-00064563\/ITC-20133062"],"award-info":[{"award-number":["CDTI-00064563\/ITC-20133062"]}]},{"name":"ICT COST Action","award":["IC1302"],"award-info":[{"award-number":["IC1302"]}]},{"name":"Xunta de Galicia co-founded with FEDER","award":["GRC2013\/053"],"award-info":[{"award-number":["GRC2013\/053"]}]},{"name":"Xunta de Galicia co-founded with FEDER","award":["Grant AP2010-6038"],"award-info":[{"award-number":["Grant AP2010-6038"]}]},{"name":"FPU Program"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1109\/tit.2015.2452252","type":"journal-article","created":{"date-parts":[[2015,7,10]],"date-time":"2015-07-10T18:55:24Z","timestamp":1436554524000},"page":"4999-5011","source":"Crossref","is-referenced-by-count":9,"title":["Efficient and Compact Representations of Prefix Codes"],"prefix":"10.1109","volume":"61","author":[{"given":"Travis","family":"Gagie","sequence":"first","affiliation":[]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[]},{"given":"Yakov","family":"Nekrich","sequence":"additional","affiliation":[]},{"given":"Alberto","family":"Ordonez","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/348751.348754"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/26.634683"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/79147.79150"},{"key":"ref32","volume":"3","author":"knuth","year":"1973","journal-title":"The Art of Computer Programming Sorting and Searching"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055554"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9140-4"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380190207"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2003.1194057"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0060-4"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/spe.741"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/0121057"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24583-1_18"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972900.9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1779"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.04.008"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11266-9_35"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.07.004"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1959.tb01583.x"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03367-4_28"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/26.469442"},{"key":"ref25","first-page":"841","article-title":"High-order entropy-compressed text indexes","author":"grossi","year":"2003","journal-title":"Proc 14th Annu ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/26.843129"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/BF01683268"},{"key":"ref52","author":"witten","year":"1999","journal-title":"Managing Gigabytes Compressing and Indexing Documents and Images"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34109-0_39"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90207-P"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799364092"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/253495.342777"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1841909.1841913"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32241-9_34"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1082036.1082043"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1240233.1240243"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90040-4"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.10.006"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.10.019"},{"key":"ref3","first-page":"111","article-title":"Compressed representations of permutations, and applications","author":"barbay","year":"2009","journal-title":"Proc 26th Int Symp Theoretical Aspects Comput Sci (STACS)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/5684.5688"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33090-2_17"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-012-9184-1"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90146-9"},{"key":"ref7","article-title":"Multiary wavelet trees in practice","author":"bowe","year":"2010"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-006-9001-9"},{"key":"ref46","article-title":"Time-space trade-offs for predecessor search","author":"p?tra?cu","year":"2008"},{"key":"ref45","first-page":"295","article-title":"Fast, small, simple rank\/select on bitmaps","volume":"7276","author":"navarro","year":"2012","journal-title":"Proc 11th Int Symp Experim Algorithms (SEA)"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1992.227470"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/363958.363991"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1412228.1412230"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/18.86980"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2013.46"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2013.07.004"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7203188\/07154462.pdf?arnumber=7154462","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:02:44Z","timestamp":1642003364000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7154462\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9]]},"references-count":52,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2452252","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9]]}}}