Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes
Abstract
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
 Publication:

arXiv eprints
 Pub Date:
 May 2024
 DOI:
 10.48550/arXiv.2405.06831
 arXiv:
 arXiv:2405.06831
 Bibcode:
 2024arXiv240506831D
 Keywords:

 Computer Science  Data Structures and Algorithms;
 F.2.2;
 E.4
 EPrint:
 Expanded version of paper appearing in ISIT 2024