{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:39:19Z","timestamp":1773376759362,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619633","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"61-66","source":"Crossref","is-referenced-by-count":1,"title":["Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes"],"prefix":"10.1109","author":[{"given":"Mordecai J.","family":"Golin","sequence":"first","affiliation":[{"name":"University of Massachusetts,Amherst"}]},{"given":"Reza Hosseini","family":"Dolatabadi","sequence":"additional","affiliation":[{"name":"Sharif University of Technology,Department of Computer Engineering,Tehran,Iran"}]},{"given":"Arian","family":"Zamani","sequence":"additional","affiliation":[{"name":"Sharif University of Technology,Department of Computer Engineering,Tehran,Iran"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Better algorithms for constructing minimum cost markov chains and AIFV codes","author":"Dolatabadi","year":"2024","journal-title":"arXiv"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/isit.2018.8437861"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/isit.2019.8849856"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/isit44484.2020.9174219"},{"key":"ref5","volume-title":"Discrete stochastic processes. Open-CourseWare: Massachusetts Institute of Technology","author":"Gallager","year":"2011"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2023.3287587"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.02.040"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834477"},{"key":"ref9","article-title":"The markov-chain polytope with applications","author":"Golin","year":"2024","journal-title":"arXiv"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/bf02579273"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2017.2694017"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834437"},{"key":"ref13","first-page":"641","article-title":"A dynamic programming algorithm to construct optimal code trees of AIFV codes","volume-title":"2016 International Symposium on Information Theory and Its Applications (ISITA)","author":"Iwata"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518033"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/itw.2017.8277992"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2015.2492961"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619633.pdf?arnumber=10619633","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:09Z","timestamp":1773347289000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619633\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619633","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}