{"id":"https://openalex.org/W2102844998","doi":"https://doi.org/10.1109/isit.2013.6620570","title":"Uniquely decodable and directly accessible non-prefix-free codes via wavelet trees","display_name":"Uniquely decodable and directly accessible non-prefix-free codes via wavelet trees","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2102844998","doi":"https://doi.org/10.1109/isit.2013.6620570","mag":"2102844998"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2013.6620570","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620570","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024416450","display_name":"M. O\u011fuzhan K\u00fclek\u00e7i","orcid":"https://orcid.org/0000-0002-4583-6261"},"institutions":[{"id":"https://openalex.org/I198068145","display_name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ft\u0131rma Kurumu","ror":"https://ror.org/04w9kkr77","country_code":"TR","type":"government","lineage":["https://openalex.org/I198068145"]},{"id":"https://openalex.org/I4210141511","display_name":"TUBITAK BILGEM","ror":"https://ror.org/057kvja37","country_code":"TR","type":"government","lineage":["https://openalex.org/I4210141511"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"M. Oguzhan Kulekci","raw_affiliation_strings":["B\u0130LGEM National Research Institute of Electronics and Cryptology, T\u00dcB\u0130TAK, Gebze, Kocaeli, Turkey","T\u00dcB\u0130TAK - B\u00ccLGEM National Research Institute of Electronics and Cryptology, Gebze, Kocaeli, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"B\u0130LGEM National Research Institute of Electronics and Cryptology, T\u00dcB\u0130TAK, Gebze, Kocaeli, Turkey","institution_ids":["https://openalex.org/I4210141511"]},{"raw_affiliation_string":"T\u00dcB\u0130TAK - B\u00ccLGEM National Research Institute of Electronics and Cryptology, Gebze, Kocaeli, Turkey","institution_ids":["https://openalex.org/I198068145"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5024416450"],"corresponding_institution_ids":["https://openalex.org/I198068145","https://openalex.org/I4210141511"],"apc_list":null,"apc_paid":null,"fwci":0.4576,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.6194117,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"4362","issue":null,"first_page":"1969","last_page":"1973"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.6956135034561157},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.5796632170677185},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.5682042837142944},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5670391917228699},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48421716690063477},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46866047382354736},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.44862914085388184},{"id":"https://openalex.org/keywords/fountain-code","display_name":"Fountain code","score":0.44720470905303955},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44064861536026},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.424172043800354},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.42282834649086},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.4064590632915497},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.342548131942749},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32145604491233826},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30538004636764526}],"concepts":[{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6956135034561157},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.5796632170677185},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.5682042837142944},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5670391917228699},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48421716690063477},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46866047382354736},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.44862914085388184},{"id":"https://openalex.org/C76132124","wikidata":"https://www.wikidata.org/wiki/Q5474786","display_name":"Fountain code","level":5,"score":0.44720470905303955},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44064861536026},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.424172043800354},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.42282834649086},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4064590632915497},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.342548131942749},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32145604491233826},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30538004636764526},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2013.6620570","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620570","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W616767364","https://openalex.org/W1509016759","https://openalex.org/W1551216210","https://openalex.org/W1591595764","https://openalex.org/W1978294273","https://openalex.org/W1985174631","https://openalex.org/W2072847621","https://openalex.org/W2087361130","https://openalex.org/W2093408358","https://openalex.org/W2096575760","https://openalex.org/W2112206685","https://openalex.org/W2134696992","https://openalex.org/W2149243190","https://openalex.org/W2151453116","https://openalex.org/W2157714561","https://openalex.org/W2163005732","https://openalex.org/W3023534291","https://openalex.org/W4240576586","https://openalex.org/W4242124034","https://openalex.org/W6644856269","https://openalex.org/W6646629931","https://openalex.org/W6672191843","https://openalex.org/W6679642144"],"related_works":["https://openalex.org/W2094225155","https://openalex.org/W1650274465","https://openalex.org/W1648222467","https://openalex.org/W2566439177","https://openalex.org/W2023299357","https://openalex.org/W2136927376","https://openalex.org/W4244214420","https://openalex.org/W2952674952","https://openalex.org/W2385872287","https://openalex.org/W1996227932"],"abstract_inverted_index":{"Unique":[0],"decodability":[1,55],"is":[2,11,85,94,101,109,122,140],"the":[3,18,30,66,95,102,136],"essential":[4],"feature":[5],"of":[6,32,97,104],"any":[7,74],"coding":[8,76],"scheme,":[9],"which":[10,69,108],"naturally":[12],"provided":[13],"by":[14,88,124],"prefix-free":[15],"codes":[16,22],"satisfying":[17],"Kraft-McMillan":[19],"inequality.":[20],"Non-prefix-free":[21],"have":[23],"received":[24],"much":[25,141],"less":[26,142],"attention":[27],"due":[28],"to":[29,36,52,56,65,73,112],"lack":[31],"an":[33,126],"efficient":[34],"method":[35,60],"support":[37],"this":[38,41],"property.":[39],"In":[40],"study":[42],"we":[43],"introduce":[44],"a":[45,114],"novel":[46],"technique":[47],"that":[48,135],"uses":[49],"wavelet":[50],"trees":[51],"bring":[53],"unique":[54,83],"non-prefix-free":[57,118],"codes.":[58,119],"Proposed":[59],"also":[61],"provides":[62],"direct":[63],"access":[64,121],"ith":[67],"codeword,":[68],"can":[70],"be":[71,113],"extended":[72],"variable-length":[75],"scheme.":[77],"The":[78],"space":[79,138],"overhead":[80,137],"required":[81],"for":[82],"decoding":[84],"upper":[86],"bounded":[87],"n\u00b7log":[89],"q":[90,100],"bits,":[91],"where":[92],"n":[93],"number":[96,103,116],"symbols,":[98],"and":[99],"distinct":[105],"codeword":[106],"lengths,":[107],"normally":[110],"expected":[111],"small":[115],"in":[117],"Direct":[120],"supported":[123],"using":[125,146],"additional":[127],"o(n":[128],"\u00b7":[129],"log":[130],"q)":[131],"bits.":[132],"We":[133],"show":[134],"requirement":[139],"than":[143],"sampling":[144],"methods":[145],"state-of-the-art":[147],"compact":[148],"integer":[149],"representations.":[150]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}