{"id":"https://openalex.org/W2044804826","doi":"https://doi.org/10.1109/tit.2012.2216975","title":"How Suboptimal Is the Shannon Code?","display_name":"How Suboptimal Is the Shannon Code?","publication_year":2012,"publication_date":"2012-09-01","ids":{"openalex":"https://openalex.org/W2044804826","doi":"https://doi.org/10.1109/tit.2012.2216975","mag":"2044804826"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2012.2216975","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2012.2216975","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","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/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":"Hamed Narimani","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","Dept. of Electr. & Comput. Eng., Isfahan Univ. of Technol., Isfahan, Iran#TAB#"],"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"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Isfahan Univ. of Technol., Isfahan, Iran#TAB#","institution_ids":["https://openalex.org/I170013655"]}]},{"author_position":"middle","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":"Mohammadali Khosravifard","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","Dept. of Electr. & Comput. Eng., Isfahan Univ. of Technol., Isfahan, Iran#TAB#"],"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"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Isfahan Univ. of Technol., Isfahan, Iran#TAB#","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. Aaron Gulliver","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Victoria, Victoria, BC, Canada","Dept. of Electr. & Comput. Eng., Univ. of Victoria, Victoria, BC, Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Victoria, Victoria, BC, Canada","institution_ids":["https://openalex.org/I212119943"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of Victoria, Victoria, BC, Canada#TAB#","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":1.3748,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.85222518,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"59","issue":"1","first_page":"458","last_page":"471"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9998000264167786,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.97079998254776,"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"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9699000120162964,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.9210045337677002},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.6657741665840149},{"id":"https://openalex.org/keywords/canonical-huffman-code","display_name":"Canonical Huffman code","score":0.6509594917297363},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.6244916915893555},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5334902405738831},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.5170865058898926},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.4792625904083252},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.46570852398872375},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4449147582054138},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43888571858406067},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.43411803245544434},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43180179595947266},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4054974913597107},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.3359031081199646},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.3136521279811859},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.26065993309020996},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.25565531849861145},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.21593129634857178},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.21535977721214294},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.20269733667373657},{"id":"https://openalex.org/keywords/systematic-code","display_name":"Systematic code","score":0.16695231199264526}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.9210045337677002},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.6657741665840149},{"id":"https://openalex.org/C115223089","wikidata":"https://www.wikidata.org/wiki/Q4885542","display_name":"Canonical Huffman code","level":5,"score":0.6509594917297363},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.6244916915893555},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5334902405738831},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.5170865058898926},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.4792625904083252},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.46570852398872375},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4449147582054138},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43888571858406067},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.43411803245544434},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43180179595947266},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4054974913597107},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.3359031081199646},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.3136521279811859},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.26065993309020996},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.25565531849861145},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.21593129634857178},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.21535977721214294},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.20269733667373657},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.16695231199264526},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2012.2216975","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2012.2216975","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322864","display_name":"Isfahan University of Technology","ror":"https://ror.org/00af3sa43"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2038649859","https://openalex.org/W2083324355","https://openalex.org/W2099111195","https://openalex.org/W2109635309","https://openalex.org/W2116843530","https://openalex.org/W2293297233","https://openalex.org/W2320190128","https://openalex.org/W2595897327"],"related_works":["https://openalex.org/W2586352442","https://openalex.org/W2344988652","https://openalex.org/W2355839800","https://openalex.org/W2920861277","https://openalex.org/W1607635215","https://openalex.org/W2742651484","https://openalex.org/W2914103308","https://openalex.org/W3124939005","https://openalex.org/W2123072960","https://openalex.org/W2351464472"],"abstract_inverted_index":{"In":[0,62],"order":[1],"to":[2,51,114,147],"determine":[3],"how":[4],"suboptimal":[5],"the":[6,18,22,35,38,42,67,87,104,108,118,122,137,140,143,159,162],"Shannon":[7,43,109,144,163],"code":[8,110,124,145,164],"is,":[9],"one":[10],"should":[11],"compare":[12,66],"its":[13,96],"performance":[14,68],"with":[15,92,155,169],"that":[16,33,103,136],"of":[17,40,69,76,89,107,121,139,142,161],"optimal":[19],"code,":[20,25],"i.e.,":[21],"corresponding":[23],"Huffman":[24,45,123],"in":[26,34],"some":[27],"sense.":[28],"It":[29,100,132],"is":[30,60,80,98,101,111,125,133,165],"well":[31],"known":[32],"worst":[36,55],"case":[37,56],"redundancy":[39,79,106,120,141,160],"both":[41],"and":[44,95],"codes":[46,71],"can":[47],"be":[48],"arbitrarily":[49],"close":[50,113],"1.":[52],"Beyond":[53],"this":[54,63],"viewpoint,":[57],"very":[58,112],"little":[59],"known.":[61],"paper,":[64],"we":[65],"these":[70],"from":[72],"an":[73],"average":[74,97,105,119],"point":[75],"view.":[77],"The":[78],"considered":[81],"as":[82,149,173],"a":[83],"random":[84],"variable":[85],"on":[86],"set":[88],"all":[90],"sources":[91,154],"n":[93,150],"symbols":[94],"evaluated.":[99],"shown":[102],"0.5":[115,167],"bits,":[116],"whereas":[117],"less":[126],"than":[127],"n-1(1+ln":[128],"n)+0.086":[129],"bits":[130,168],".":[131],"also":[134],"proven":[135],"variance":[138],"tends":[146],"zero":[148],"increases.":[151],"Therefore,":[152],"for":[153],"alphabet":[156],"size":[157],"n,":[158],"approximately":[166],"probability":[170],"approaching":[171],"1":[172],"n\u2192":[174],"\u221e.":[175]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}