{"id":"https://openalex.org/W3016500741","doi":"https://doi.org/10.1109/tit.2020.2987309","title":"Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes","display_name":"Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes","publication_year":2020,"publication_date":"2020-04-14","ids":{"openalex":"https://openalex.org/W3016500741","doi":"https://doi.org/10.1109/tit.2020.2987309","mag":"3016500741"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2020.2987309","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2020.2987309","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/A5047988836","display_name":"Mohammad Javad-Kalbasi","orcid":"https://orcid.org/0000-0001-5888-9808"},"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"]},{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA","IR"],"is_corresponding":false,"raw_author_name":"Mohammad Javad-Kalbasi","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","Department of Electrical and Computer Engineering, University of Toronto, Toronto, Canada"],"raw_orcid":"https://orcid.org/0000-0001-5888-9808","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":"Department of Electrical and Computer Engineering, University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","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":"https://orcid.org/0000-0002-0645-7285","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran","institution_ids":["https://openalex.org/I170013655"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1627,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.48047888,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"66","issue":"7","first_page":"4419","last_page":"4430"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9991999864578247,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9990000128746033,"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/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9973000288009644,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6821590662002563},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6146271228790283},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.5733718872070312},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.5450312495231628},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.5025749206542969},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48818665742874146},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4619944393634796},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.43816179037094116},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.4328002333641052},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.4163798987865448},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.29511189460754395},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.264298677444458},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.25792986154556274},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.25639230012893677},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24351701140403748},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1570725440979004},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0615558922290802}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6821590662002563},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6146271228790283},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.5733718872070312},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.5450312495231628},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.5025749206542969},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48818665742874146},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4619944393634796},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.43816179037094116},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.4328002333641052},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.4163798987865448},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.29511189460754395},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.264298677444458},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.25792986154556274},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.25639230012893677},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24351701140403748},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1570725440979004},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0615558922290802},{"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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/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.2020.2987309","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2020.2987309","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":24,"referenced_works":["https://openalex.org/W1510013050","https://openalex.org/W1555278369","https://openalex.org/W1597182570","https://openalex.org/W1972376834","https://openalex.org/W1972418150","https://openalex.org/W1973429478","https://openalex.org/W2033806151","https://openalex.org/W2038649859","https://openalex.org/W2048616227","https://openalex.org/W2067998715","https://openalex.org/W2072549963","https://openalex.org/W2093019151","https://openalex.org/W2096900278","https://openalex.org/W2103424467","https://openalex.org/W2110636207","https://openalex.org/W2147086091","https://openalex.org/W2147680448","https://openalex.org/W2159977619","https://openalex.org/W2166451469","https://openalex.org/W2478708596","https://openalex.org/W2541329686","https://openalex.org/W4245952386","https://openalex.org/W4255350051","https://openalex.org/W6635812967"],"related_works":["https://openalex.org/W2048135010","https://openalex.org/W2123950685","https://openalex.org/W2058342272","https://openalex.org/W2048616227","https://openalex.org/W2020560811","https://openalex.org/W2166346116","https://openalex.org/W1981009684","https://openalex.org/W2112938612","https://openalex.org/W2176709902","https://openalex.org/W2776473626"],"abstract_inverted_index":{"The":[0,32],"tight":[1,42,130,142,153],"lower":[2,43,87,116,127,154],"bound":[3,155],"on":[4,89,110],"the":[5,20,23,30,41,56,79,90,103,107,111,114,152,159,162,167],"redundancy":[6,91],"of":[7,13,35,47,55,61,78,92,106,113,158,161],"optimal":[8,93,119,132,170,173],"prefix-free":[9,69,94,171],"codes":[10,66,70,95,134],"in":[11,29,45,156],"terms":[12,46,157],"a":[14,76],"given":[15],"symbol":[16,53,165],"probability":[17,160],"(not":[18],"necessarily":[19],"largest":[21],"or":[22],"smallest":[24],"one)":[25],"has":[26],"been":[27],"derived":[28,115],"literature.":[31],"first":[33],"goal":[34],"this":[36],"paper":[37,108],"is":[38,75,83,109,123,149,166],"to":[39],"derive":[40],"bounds":[44,88,117,128],"j":[48,136,144],"(j":[49],">":[50],"1)":[51],"known":[52],"probabilities":[54],"source":[57],"using":[58],"some":[59],"properties":[60],"Kullback-Leibler":[62],"distance.":[63],"Since":[64],"fix-free":[65,100,120,133,174],"are":[67,96,129,140],"special":[68],"(for":[71],"which":[72],"no":[73],"codeword":[74],"suffix":[77],"other":[80],"codewords),":[81],"it":[82,148],"clear":[84],"that":[85,125,151],"all":[86],"also":[97],"valid":[98],"for":[99,118,131,143,169],"ones.":[101],"Accordingly,":[102],"second":[104],"question":[105],"tightness":[112],"codes.":[121,175],"It":[122],"proven":[124],"these":[126],"if":[135],"\u2264":[137],"3,":[138],"and":[139,172],"not":[141],"\u2265":[145],"4.":[146],"Also,":[147],"shown":[150],"most":[163],"likely":[164],"same":[168]},"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}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}