Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes
<|reference_start|>Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes: The problem of constructing optimal AIFV codes is a special case of that of constructing minimum cost Markov Chains. This paper provides the first complete proof of correctness for the previously known iterative algorithm for constructing such Markov chains.   A recent work describes how to efficiently solve the Markov Chain problem by first constructing a Markov Chain Polytope and then running the Ellipsoid algorithm for linear programming on it. This paper's second result is that, in the AIFV case, a special property of the polytope instead permits solving the corresponding linear program using simple binary search<|reference_end|>
@article{dolatabadi2024better,
    title={Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV
  Codes},
    author={Reza Hosseini Dolatabadi, Mordedcai J. Golin, Arian Zamani},
    journal={arXiv preprint arXiv:2405.06831},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.06831},
    primaryClass={cs.DS}
}