Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913416098086912 |
|---|---|
| author | Dolatabadi, Reza Hosseini Golin, Mordedcai J. Zamani, Arian |
| author_facet | Dolatabadi, Reza Hosseini Golin, Mordedcai J. Zamani, Arian |
| contents | 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 |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_06831 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes Dolatabadi, Reza Hosseini Golin, Mordedcai J. Zamani, Arian Data Structures and Algorithms F.2.2; E.4 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 |
| title | Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes |
| topic | Data Structures and Algorithms F.2.2; E.4 |
| url | https://arxiv.org/abs/2405.06831 |