{"id":"https://openalex.org/W1972418150","doi":"https://doi.org/10.1109/tit.2015.2425405","title":"The Redundancy of an Optimal Binary Fix-Free Code Is Not Greater Than 1 bit","display_name":"The Redundancy of an Optimal Binary Fix-Free Code Is Not Greater Than 1 bit","publication_year":2015,"publication_date":"2015-04-22","ids":{"openalex":"https://openalex.org/W1972418150","doi":"https://doi.org/10.1109/tit.2015.2425405","mag":"1972418150"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2015.2425405","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2015.2425405","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/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"],"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/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"],"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":"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"],"raw_orcid":"https://orcid.org/0000-0001-9919-0323","affiliations":[{"raw_affiliation_string":"Department of Electrical and 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.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.04338713,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"61","issue":"6","first_page":"3549","last_page":"3558"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9986000061035156,"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"}},{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9940000176429749,"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.758499264717102},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.6889505386352539},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.6153321266174316},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5268396735191345},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5148805379867554},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5145111083984375},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.49443674087524414},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.4588518738746643},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4493716359138489},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44885537028312683},{"id":"https://openalex.org/keywords/gray-code","display_name":"Gray code","score":0.4212344288825989},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36192837357521057},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3289387822151184},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3123011887073517},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.30802518129348755},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.30149441957473755},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.2514846920967102},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.18818899989128113}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.758499264717102},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.6889505386352539},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.6153321266174316},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5268396735191345},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5148805379867554},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5145111083984375},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.49443674087524414},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.4588518738746643},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4493716359138489},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44885537028312683},{"id":"https://openalex.org/C129861397","wikidata":"https://www.wikidata.org/wiki/Q332772","display_name":"Gray code","level":2,"score":0.4212344288825989},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36192837357521057},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3289387822151184},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3123011887073517},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.30802518129348755},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.30149441957473755},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.2514846920967102},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.18818899989128113},{"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.2015.2425405","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2015.2425405","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":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1597182570","https://openalex.org/W1984577633","https://openalex.org/W2033806151","https://openalex.org/W2038649859","https://openalex.org/W2043622336","https://openalex.org/W2060108852","https://openalex.org/W2072549963","https://openalex.org/W2079251747","https://openalex.org/W2096900278","https://openalex.org/W2106219841","https://openalex.org/W2108211616","https://openalex.org/W2110968394","https://openalex.org/W2127560848","https://openalex.org/W2140199336","https://openalex.org/W2149258547","https://openalex.org/W2164031265","https://openalex.org/W2166451469","https://openalex.org/W2478708596","https://openalex.org/W2541329686","https://openalex.org/W6635812967"],"related_works":["https://openalex.org/W2056723920","https://openalex.org/W4237802754","https://openalex.org/W2011506041","https://openalex.org/W2016524125","https://openalex.org/W2166346116","https://openalex.org/W2742651484","https://openalex.org/W2521025190","https://openalex.org/W2104740387","https://openalex.org/W1969741585","https://openalex.org/W2161708016"],"abstract_inverted_index":{"In":[0,42],"the":[1,6,13,21,35,48,54,69,82,92],"context":[2],"of":[3,12,23,71,84,91],"fix-free":[4,27,73,87],"codes,":[5,38],"most":[7],"important":[8],"and":[9],"immediate":[10],"consequence":[11],"3/4-conjecture":[14],"(if":[15],"it":[16],"is":[17,19,50],"proven),":[18],"that":[20],"redundancy":[22,49,83],"an":[24,77,85],"optimal":[25,36,86],"binary":[26,72],"code":[28,88],"never":[29],"exceeds":[30],"1":[31],"bit,":[32],"as":[33],"with":[34],"prefix-free":[37],"i.e.":[39],"Huffman":[40],"codes.":[41],"this":[43,45],"paper,":[44],"bound":[46,80],"on":[47,81],"proven":[51],"without":[52],"requiring":[53],"conjecture":[55],"to":[56,75],"be":[57],"true.":[58],"To":[59],"do":[60],"so,":[61],"we":[62],"use":[63],"two":[64],"known":[65],"sufficient":[66],"conditions":[67],"for":[68],"existence":[70],"codes":[74],"derive":[76],"improved":[78],"upper":[79],"in":[89],"terms":[90],"largest":[93],"symbol":[94],"probability.":[95]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}