{"id":"https://openalex.org/W2514983544","doi":"https://doi.org/10.1109/isit.2016.7541050","title":"Tight upper bounds on the redundancy of optimal binary AIFV codes","display_name":"Tight upper bounds on the redundancy of optimal binary AIFV codes","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2514983544","doi":"https://doi.org/10.1109/isit.2016.7541050","mag":"2514983544"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2016.7541050","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541050","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-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/A5102025770","display_name":"Weihua Hu","orcid":"https://orcid.org/0000-0003-2956-2616"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Weihua Hu","raw_affiliation_strings":["Dept. of Mathematical Eng., The University of Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Dept. of Mathematical Eng., The University of Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084723015","display_name":"H. Yamamoto","orcid":"https://orcid.org/0000-0001-6297-8838"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hirosuke Yamamoto","raw_affiliation_strings":["Dept. of Complexity Sci. and Eng., The University of Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Dept. of Complexity Sci. and Eng., The University of Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112464181","display_name":"Junya Honda","orcid":null},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Junya Honda","raw_affiliation_strings":["Dept. of Complexity Sci. and Eng., The University of Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Dept. of Complexity Sci. and Eng., The University of Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102025770"],"corresponding_institution_ids":["https://openalex.org/I74801974"],"apc_list":null,"apc_paid":null,"fwci":0.4444,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.79431091,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"6","last_page":"10"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9743000268936157,"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.9569000005722046,"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.9421298503875732},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7182385921478271},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6039794683456421},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.5906140804290771},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5860636830329895},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5022287368774414},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4902063012123108},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4442930519580841},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.4404810070991516},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38625556230545044},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3640725016593933},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.27312415838241577},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1464732587337494}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.9421298503875732},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7182385921478271},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6039794683456421},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.5906140804290771},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5860636830329895},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5022287368774414},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4902063012123108},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4442930519580841},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.4404810070991516},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38625556230545044},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3640725016593933},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.27312415838241577},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1464732587337494},{"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/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/isit.2016.7541050","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541050","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","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":10,"referenced_works":["https://openalex.org/W1972376834","https://openalex.org/W2038649859","https://openalex.org/W2048616227","https://openalex.org/W2060108852","https://openalex.org/W2070214433","https://openalex.org/W2096900278","https://openalex.org/W2103424467","https://openalex.org/W2110636207","https://openalex.org/W2169476932","https://openalex.org/W2963079252"],"related_works":["https://openalex.org/W2104740387","https://openalex.org/W2765909687","https://openalex.org/W2003530001","https://openalex.org/W2096900278","https://openalex.org/W2081519449","https://openalex.org/W2115275536","https://openalex.org/W2187793625","https://openalex.org/W1996178875","https://openalex.org/W2019417807","https://openalex.org/W1513684005"],"abstract_inverted_index":{"AIFV":[0,32,55,100,138],"codes":[1,4,33,56,101,144],"are":[2,34],"lossless":[3],"that":[5],"generalize":[6],"the":[7,50,63,66,74,95,105,118,121,128,133,143],"class":[8],"of":[9,52,68,97,120,135,142],"instantaneous":[10],"FV":[11],"codes.":[12,44,70,147],"The":[13],"code":[14,17],"uses":[15],"multiple":[16],"trees":[18],"and":[19],"assigns":[20],"source":[21,124],"symbols":[22],"to":[23,30,37,60,79,84],"incomplete":[24],"internal":[25],"nodes":[26],"as":[27,29,65],"well":[28],"leaves.":[31],"empirically":[35],"shown":[36,83],"attain":[38],"better":[39],"compression":[40],"ratio":[41],"than":[42],"Huffman":[43,69,146],"Nevertheless,":[45],"an":[46],"upper":[47,75,92],"bound":[48,67,76,93],"on":[49,94,132],"redundancy":[51,96,134],"optimal":[53,98,136],"binary":[54,99,137],"is":[57,77,82,102,117,127],"only":[58],"known":[59],"be":[61,85],"1,":[62],"same":[64],"In":[71],"this":[72],"paper,":[73],"improved":[78],"1/2,":[80],"which":[81],"tight.":[86],"Along":[87],"with":[88],"this,":[89],"a":[90],"tight":[91],"derived":[103],"for":[104],"case":[106],"p":[107,113],"<sub":[108,114],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[109,115],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">max</sub>":[110,116],"\u22651/2,":[111],"where":[112],"probability":[119],"most":[122],"likely":[123],"symbol.":[125],"This":[126],"first":[129],"theoretical":[130],"work":[131],"codes,":[139],"suggesting":[140],"superiority":[141],"over":[145]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-03-21T06:30:42.041108","created_date":"2025-10-10T00:00:00"}