2024/05/10 by Dolatabadi, Reza Hosseini, Golin, Mordedcai J., Zamani, Arian
#Data Structures and Algorithms (cs.DS) #E.4 #F.2.2 #FOS: Computer and information sciences
paper · doi:10.48550/arxiv.2405.06831
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