{"id":"https://openalex.org/W4381199143","doi":"https://doi.org/10.1109/tit.2023.3287587","title":"A Polynomial Time Algorithm for Constructing Optimal Binary AIFV-2 Codes","display_name":"A Polynomial Time Algorithm for Constructing Optimal Binary AIFV-2 Codes","publication_year":2023,"publication_date":"2023-06-19","ids":{"openalex":"https://openalex.org/W4381199143","doi":"https://doi.org/10.1109/tit.2023.3287587"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2023.3287587","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2023.3287587","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/A5051953152","display_name":"Mordecai J. Golin","orcid":"https://orcid.org/0000-0002-1260-6574"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Mordecai Golin","raw_affiliation_strings":["Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Sai Kung, New Territories, Hong Kong"],"raw_orcid":"https://orcid.org/0000-0002-1260-6574","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Sai Kung, New Territories, Hong Kong","institution_ids":["https://openalex.org/I200769079"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091358318","display_name":"Elfarouk Harb","orcid":"https://orcid.org/0000-0002-7770-0932"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]},{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]},{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK","US"],"is_corresponding":false,"raw_author_name":"Elfarouk Harb","raw_affiliation_strings":["Department of Mathematics and the Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Sai Kung, New Territories, Hong Kong","Department of Computer Science, University of Illinois at Urbana--Champaign (UIUC), Champaign, IL, USA"],"raw_orcid":"https://orcid.org/0000-0002-7770-0932","affiliations":[{"raw_affiliation_string":"Department of Mathematics and the Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Sai Kung, New Territories, Hong Kong","institution_ids":["https://openalex.org/I200769079","https://openalex.org/I889458895"]},{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Urbana--Champaign (UIUC), Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5238,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71429339,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"69","issue":"10","first_page":"6269","last_page":"6278"},"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.9886999726295471,"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.7351927757263184},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.5574223399162292},{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.5465001463890076},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5235350131988525},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5113846659660339},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5005800724029541},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4786280691623688},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4464249610900879},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.42697620391845703},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.42540988326072693},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.327228307723999},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.2142152190208435},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.09521907567977905}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.7351927757263184},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.5574223399162292},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.5465001463890076},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5235350131988525},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5113846659660339},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5005800724029541},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4786280691623688},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4464249610900879},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.42697620391845703},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.42540988326072693},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.327228307723999},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2142152190208435},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.09521907567977905},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2023.3287587","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2023.3287587","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"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-131674","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-131674","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W2012329067","https://openalex.org/W2070214433","https://openalex.org/W2148949320","https://openalex.org/W2159266843","https://openalex.org/W2583343534","https://openalex.org/W2742651484","https://openalex.org/W2785487930","https://openalex.org/W2886231064","https://openalex.org/W2945747618","https://openalex.org/W2963079252","https://openalex.org/W2963275264","https://openalex.org/W2975172758","https://openalex.org/W2975920387","https://openalex.org/W3081123211","https://openalex.org/W3130619598","https://openalex.org/W6733229216"],"related_works":["https://openalex.org/W2141317899","https://openalex.org/W4312409941","https://openalex.org/W4296567424","https://openalex.org/W1969741585","https://openalex.org/W2025454449","https://openalex.org/W3143996415","https://openalex.org/W2167474439","https://openalex.org/W2078591209","https://openalex.org/W2159205125","https://openalex.org/W2915557332"],"abstract_inverted_index":{"Huffman":[0,38],"Codes":[1],"are":[2,53,80],"optimal":[3,78,101,136],"Instantaneous":[4],"Fixed-to-Variable":[5],"(FV)":[6],"codes":[7],"in":[8,152],"which":[9,48],"every":[10],"source":[11,154],"symbol":[12],"can":[13,36],"only":[14,54],"be":[15],"encoded":[16],"by":[17],"one":[18,166],"codeword.":[19],"Relaxing":[20],"these":[21],"constraints":[22],"permits":[23],"constructing":[24,77,135],"better":[25],"FV":[26],"codes.":[27,138],"More":[28],"specifically,":[29],"recent":[30],"work":[31],"has":[32],"shown":[33],"that":[34,60,83],"AIFV-$m$codes":[35,40,79],"beat":[37],"coding.":[39],"construct":[41,84],"an$m$-tuple":[42],"of":[43,68,72,88,118,121,128,150,160],"different":[44],"coding":[45],"trees":[46],"between":[47],"the":[49,100,109,119,126,129,148,153,157],"code":[50,89,102],"alternates":[51],"and":[52],"almost":[55],"instantaneous":[56],"(AI).":[57],"This":[58,112,139],"means":[59],"decoding":[61],"a":[62,66,69,115],"word":[63],"might":[64],"require":[65],"delay":[67],"finite":[70],"number":[71,149,159],"bits.":[73],"Current":[74],"algorithms":[75],"for":[76,134],"iterative":[81],"processes":[82,92],"progressively":[85],"\u201cbetter":[86],"sets\u201d":[87],"trees.":[90],"The":[91],"have":[93],"been":[94],"proven":[95],"to":[96,99,163],"finitely":[97],"converge":[98],"but":[103],"with":[104],"no":[105],"known":[106],"bounds":[107],"on":[108],"convergence":[110],"rate.":[111],"paper":[113],"derives":[114],"geometric":[116],"interpretation":[117],"space":[120],"binary":[122],"AIFV-2":[123],"codes,":[124],"permitting":[125],"development":[127],"first":[130],"polynomially":[131],"time-bounded":[132],"procedure":[133,142],"AIFV":[137],"binary-search":[140],"like":[141],"will":[143],"run":[144],"in$O(n^{3}":[145],"b)$time,":[146],"where$n$is":[147],"symbols":[151],"alphabet":[155],"and$b$is":[156],"maximum":[158],"bits":[161],"used":[162],"encode":[164],"any":[165],"input":[167],"probability.":[168]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}