{"id":"https://openalex.org/W4401693643","doi":"https://doi.org/10.1109/isit57864.2024.10619633","title":"Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes","display_name":"Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes","publication_year":2024,"publication_date":"2024-07-07","ids":{"openalex":"https://openalex.org/W4401693643","doi":"https://doi.org/10.1109/isit57864.2024.10619633"},"language":"en","primary_location":{"id":"doi:10.1109/isit57864.2024.10619633","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit57864.2024.10619633","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 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/A5051953152","display_name":"Mordecai J. Golin","orcid":"https://orcid.org/0000-0002-1260-6574"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mordecai J. Golin","raw_affiliation_strings":["University of Massachusetts,Amherst"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts,Amherst","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5098446424","display_name":"Reza Hosseini Dolatabadi","orcid":null},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Reza Hosseini Dolatabadi","raw_affiliation_strings":["Sharif University of Technology,Department of Computer Engineering,Tehran,Iran"],"affiliations":[{"raw_affiliation_string":"Sharif University of Technology,Department of Computer Engineering,Tehran,Iran","institution_ids":["https://openalex.org/I133529467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113340194","display_name":"Arian Zamani","orcid":null},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Arian Zamani","raw_affiliation_strings":["Sharif University of Technology,Department of Computer Engineering,Tehran,Iran"],"affiliations":[{"raw_affiliation_string":"Sharif University of Technology,Department of Computer Engineering,Tehran,Iran","institution_ids":["https://openalex.org/I133529467"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5051953152"],"corresponding_institution_ids":["https://openalex.org/I24603500"],"apc_list":null,"apc_paid":null,"fwci":0.8207,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.78463929,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"61","last_page":"66"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.2345000058412552,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.2345000058412552,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/computer-science","display_name":"Computer science","score":0.6898769736289978},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.6590550541877747},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4958544671535492},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32308700680732727},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.08080554008483887}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6898769736289978},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6590550541877747},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4958544671535492},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32308700680732727},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.08080554008483887}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit57864.2024.10619633","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit57864.2024.10619633","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-160273","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-160273","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":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"Almost":[0],"Instantaneous":[1],"Fixed":[2],"to":[3,70],"Variable":[4],"(AIFV)":[5],"coding":[6,15,24],"is":[7,33,99],"a":[8,34,80,105],"relatively":[9],"new":[10],"method":[11],"of":[12,28,37,39,52,108],"loss":[13],"less":[14],"that,":[16,100],"unlike":[17],"Huffman":[18],"coding,":[19],"uses":[20],"more":[21],"than":[22],"one":[23],"tree.":[25],"The":[26],"problem":[27,76],"constructing":[29,40,61,79],"optimal":[30],"AIFV":[31,103],"codes":[32],"special":[35,106],"case":[36],"that":[38],"minimum":[41],"cost":[42],"Markov":[43,63,74,81],"Chains.":[44],"This":[45,95],"paper":[46],"provides":[47],"the":[48,55,73,87,102,109,114],"first":[49,78],"complete":[50],"proof":[51],"correctness":[53],"for":[54,60,90],"previously":[56],"known":[57],"iterative":[58],"algorithm":[59,89],"such":[62],"chains.":[64],"A":[65],"recent":[66],"work":[67],"describes":[68],"how":[69],"efficiently":[71],"solve":[72],"Chain":[75,82],"by":[77],"Polytope":[83],"and":[84],"then":[85],"running":[86],"Ellipsoid":[88],"linear":[91,116],"programming":[92],"on":[93],"it.":[94],"paper's":[96],"second":[97],"result":[98],"in":[101],"case,":[104],"property":[107],"polytope":[110],"instead":[111],"permits":[112],"solving":[113],"corresponding":[115],"program":[117],"using":[118],"simple":[119],"binary":[120],"search.":[121]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-04T09:10:02.777135","created_date":"2025-10-10T00:00:00"}