{"id":"https://openalex.org/W2072549963","doi":"https://doi.org/10.1109/tit.2012.2189433","title":"Some Upper Bounds on the Redundancy of Optimal Binary Fix-Free Codes","display_name":"Some Upper Bounds on the Redundancy of Optimal Binary Fix-Free Codes","publication_year":2012,"publication_date":"2012-03-05","ids":{"openalex":"https://openalex.org/W2072549963","doi":"https://doi.org/10.1109/tit.2012.2189433","mag":"2072549963"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2012.2189433","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2012.2189433","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/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/A5071523386","display_name":"Shima Kheradmand","orcid":"https://orcid.org/0009-0009-7964-0409"},"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":"Shima Kheradmand","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"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I170013655"],"apc_list":null,"apc_paid":null,"fwci":2.1747,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.88778817,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"58","issue":"6","first_page":"4049","last_page":"4057"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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.9966999888420105,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9894000291824341,"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/huffman-coding","display_name":"Huffman coding","score":0.8623589277267456},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.7572940587997437},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6718623638153076},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5939688086509705},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4850863516330719},{"id":"https://openalex.org/keywords/universal-code","display_name":"Universal code","score":0.4675423502922058},{"id":"https://openalex.org/keywords/canonical-huffman-code","display_name":"Canonical Huffman code","score":0.46402767300605774},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.44333210587501526},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.4284183382987976},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.4253954291343689},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.41986212134361267},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3681807219982147},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36031579971313477},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34764114022254944},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.32721275091171265},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.30170774459838867},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.29172852635383606},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.27321502566337585},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.18234872817993164},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.16385149955749512},{"id":"https://openalex.org/keywords/systematic-code","display_name":"Systematic code","score":0.10301852226257324}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.8623589277267456},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.7572940587997437},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6718623638153076},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5939688086509705},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4850863516330719},{"id":"https://openalex.org/C197294415","wikidata":"https://www.wikidata.org/wiki/Q4176366","display_name":"Universal code","level":5,"score":0.4675423502922058},{"id":"https://openalex.org/C115223089","wikidata":"https://www.wikidata.org/wiki/Q4885542","display_name":"Canonical Huffman code","level":5,"score":0.46402767300605774},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.44333210587501526},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.4284183382987976},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.4253954291343689},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.41986212134361267},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3681807219982147},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36031579971313477},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34764114022254944},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.32721275091171265},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.30170774459838867},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.29172852635383606},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.27321502566337585},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.18234872817993164},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.16385149955749512},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.10301852226257324},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2012.2189433","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2012.2189433","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":[{"score":0.4699999988079071,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1505142331","https://openalex.org/W1597182570","https://openalex.org/W1972376834","https://openalex.org/W2038649859","https://openalex.org/W2060108852","https://openalex.org/W2076803615","https://openalex.org/W2093019151","https://openalex.org/W2096900278","https://openalex.org/W2108211616","https://openalex.org/W2110636207","https://openalex.org/W2110968394","https://openalex.org/W2125700782","https://openalex.org/W2126711987","https://openalex.org/W2142832396","https://openalex.org/W2143177448","https://openalex.org/W2147680448","https://openalex.org/W2149258547","https://openalex.org/W2157428332","https://openalex.org/W2163301895","https://openalex.org/W2164031265","https://openalex.org/W2166451469","https://openalex.org/W2241994223","https://openalex.org/W2478708596","https://openalex.org/W2541329686","https://openalex.org/W3103107560","https://openalex.org/W4255350051","https://openalex.org/W6635812967","https://openalex.org/W6690483332"],"related_works":["https://openalex.org/W2166346116","https://openalex.org/W4237802754","https://openalex.org/W2056723920","https://openalex.org/W2920861277","https://openalex.org/W2016524125","https://openalex.org/W2114700786","https://openalex.org/W2360576622","https://openalex.org/W2104740387","https://openalex.org/W2742651484","https://openalex.org/W3023850908"],"abstract_inverted_index":{"In":[0,165],"order":[1],"to":[2,167],"investigate":[3],"the":[4,12,20,23,31,38,51,94,109,129,134,140,142,147,150,178,180],"cost":[5],"of":[6,11,22,53,78,96,108,149,177],"employing":[7],"fix-free":[8,25,80,98,152],"codes":[9,26,34,153],"instead":[10],"well-established":[13],"prefix-free":[14],"codes,":[15,48],"some":[16,45],"upper":[17,121,144,173],"bounds":[18,174],"on":[19,44,146],"redundancy":[21,52,95,148],"optimal":[24,64,151],"and":[27,112,182],"their":[28],"difference":[29],"with":[30,68,82],"corresponding":[32],"Huffman":[33,110],"are":[35,188],"presented.":[36],"Unlike":[37],"conventional":[39],"approach,":[40],"which":[41],"is":[42,60,85,91,123,136],"based":[43],"Shannon-like":[46],"suboptimal":[47],"we":[49],"examine":[50],"a":[54,72,79],"better":[55],"Huffman-like":[56],"code.":[57],"An":[58],"algorithm":[59],"proposed":[61],"for":[62,71],"deriving":[63],"binary":[65],"codeword":[66],"lengths":[67],"Kraft-sum":[69],"[5/8]":[70],"given":[73,185],"probability":[74,187],"distribution.":[75],"The":[76],"existence":[77],"code":[81,99,111],"such":[83],"codelengths":[84],"guaranteed":[86],"by":[87,159],"Yekhanin's":[88],"theorem.":[89],"It":[90],"shown":[92],"that":[93,107],"this":[97],"is,":[100],"at":[101],"most,":[102],"0.8":[103],"bit":[104,126],"greater":[105],"than":[106,128],"does":[113],"not":[114],"exceed":[115],"[8/3]-log3":[116],"\u2245":[117,162],"1.0817":[118],"bits.":[119],"This":[120],"bound":[122,145],"[4/3]-log[5/3]":[124],"\u22450.5964":[125],"less":[127],"best":[130],"known":[131,172],"one.":[132],"If":[133],"[3/4]-conjecture":[135],"proved":[137],"sometime":[138],"in":[139,175],"future,":[141],"presented":[143],"(i.e.,":[154],"1.0817)":[155],"will":[156],"be":[157],"improved":[158],"only":[160],"[5/3]-log3":[161],"0.0817":[163],".":[164],"addition":[166],"these":[168],"general":[169],"bounds,":[170],"all":[171],"terms":[176],"largest,":[179],"smallest,":[181],"an":[183],"arbitrary":[184],"symbol":[186],"substantially":[189],"improved.":[190]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}