{"id":"https://openalex.org/W2149888084","doi":"https://doi.org/10.1109/isit.2009.5205279","title":"Two recursive versions of the Shannon code","display_name":"Two recursive versions of the Shannon code","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2149888084","doi":"https://doi.org/10.1109/isit.2009.5205279","mag":"2149888084"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205279","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205279","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 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/A5090381199","display_name":"Mohammadali Khosravifard","orcid":"https://orcid.org/0000-0002-0645-7285"},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"M. Khosravifard","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083706546","display_name":"Hamed Narimani","orcid":"https://orcid.org/0000-0002-2057-8382"},"institutions":[{"id":"https://openalex.org/I170013655","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43","country_code":"IR","type":"education","lineage":["https://openalex.org/I170013655"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"H. Narimani","raw_affiliation_strings":["Department of Electrical & Compo Engineering, Isfahan University of Technology, Isfahan, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical & Compo Engineering, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035133764","display_name":"T. Aaron Gulliver","orcid":"https://orcid.org/0000-0001-9919-0323"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"T. A. Gulliver","raw_affiliation_strings":["Department of Electrical & Computer Engineering, University of Victoria, Victoria, BC, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, University of Victoria, Victoria, BC, Canada","institution_ids":["https://openalex.org/I212119943"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2437,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.52606938,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"48","issue":null,"first_page":"209","last_page":"213"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9987000226974487,"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.9987000226974487,"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/T12029","display_name":"DNA and Biological Computing","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.8688411712646484},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.7057166695594788},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5808594226837158},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5485402941703796},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5119858384132385},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.47142094373703003},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44379037618637085},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.4420676827430725},{"id":"https://openalex.org/keywords/canonical-huffman-code","display_name":"Canonical Huffman code","score":0.41292381286621094},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39873677492141724},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34716784954071045},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3038225769996643},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.20604217052459717},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.18506908416748047},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.1672516167163849},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.13375967741012573},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08952975273132324},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.08917450904846191},{"id":"https://openalex.org/keywords/systematic-code","display_name":"Systematic code","score":0.08884990215301514}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.8688411712646484},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.7057166695594788},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5808594226837158},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5485402941703796},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5119858384132385},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.47142094373703003},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44379037618637085},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.4420676827430725},{"id":"https://openalex.org/C115223089","wikidata":"https://www.wikidata.org/wiki/Q4885542","display_name":"Canonical Huffman code","level":5,"score":0.41292381286621094},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39873677492141724},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34716784954071045},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3038225769996643},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.20604217052459717},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.18506908416748047},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.1672516167163849},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.13375967741012573},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08952975273132324},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.08917450904846191},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.08884990215301514},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2009.5205279","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205279","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2110084720","https://openalex.org/W2110636207","https://openalex.org/W2141502707"],"related_works":["https://openalex.org/W4237802754","https://openalex.org/W2166346116","https://openalex.org/W3022794168","https://openalex.org/W4296567424","https://openalex.org/W2344988652","https://openalex.org/W2355839800","https://openalex.org/W1518463267","https://openalex.org/W4312409941","https://openalex.org/W2161708016","https://openalex.org/W3143996415"],"abstract_inverted_index":{"For":[0],"a":[1,30,63,140],"given":[2],"memoryless":[3],"information":[4],"source,":[5],"the":[6,10,15,20,26,43,49,52,55,75,91,95,100,108,112,128,132,144,162,166,169,179,183,197,201,215],"Huffman":[7,27,92,216],"code":[8,13,28,77,93,110,185],"is":[9,29,62,102,137,159,172,186,211],"optimal":[11],"prefix-free":[12],"in":[14,25],"sense":[16],"of":[17,22,32,54,65,74,90,107,131,146,165,168,182,200],"redundancy.":[18],"Generally,":[19],"length":[21,53,115],"each":[23],"codeword":[24,57,114],"function":[31,64],"all":[33,147],"symbol":[34],"probabilities":[35],"p1,":[36],"p2,":[37],"...,":[38,122],"pn.":[39,123],"In":[40,68,98,124],"contrast,":[41],"with":[42,149],"best":[44],"known":[45],"suboptimal":[46],"code,":[47,51],"i.e.,":[48],"Shannon":[50,76,96,109,184],"i-th":[56,113],"(i.e.":[58],"[-":[59],"log":[60],"pi])":[61],"only":[66],"pi.":[67],"this":[69],"paper,":[70],"two":[71],"recursive":[72],"versions":[73],"(RYY":[78],"and":[79,94,111,161,207],"RSh)":[80],"are":[81,204],"proposed":[82,133,202],"which":[83,86],"have":[84],"redundancy":[85,101,136,167,181,199],"lies":[87],"between":[88],"that":[89,106,178,192],"code.":[97,217],"particular,":[99],"not":[103,117],"greater":[104],"than":[105],"does":[116],"depend":[118],"on":[119,143],"pi+1,":[120],"pi+2,":[121],"order":[125],"to":[126],"evaluate":[127],"overall":[129],"performance":[130],"codes,":[134],"their":[135],"considered":[138],"as":[139],"random":[141,156],"variable":[142],"set":[145],"sources":[148],"n":[150,194],"symbols.":[151],"An":[152],"algorithm":[153],"for":[154,193,214],"generating":[155],"n-tuple":[157],"distributions":[158],"derived":[160],"expected":[163],"value":[164],"resulting":[170],"codes":[171,203],"estimated.":[173],"Recently,":[174],"it":[175,210],"was":[176],"proven":[177],"average":[180,198],"around":[187],"0.5":[188],"bits.":[189],"Simulation":[190],"shows":[191],">":[195],"20":[196],"about":[205],"0.1":[206],"0.06,":[208],"while":[209],"approximately":[212],"0.03":[213]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}