Worst-case optimal adaptive alphabetic prefix-free coding
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2021
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917187278602240 |
|---|---|
| author | Gagie, Travis |
| author_facet | Gagie, Travis |
| contents | We give the first algorithm for adaptive alphabetic prefix-free coding that is worst-case optimal in terms of time and compression when $σ\in o \left( \frac{n^{1 / 2}}{\log n} \right)$, where $σ$ is the size of the alphabet and $n$ is the length of the input. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2109_02997 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Worst-case optimal adaptive alphabetic prefix-free coding Gagie, Travis Data Structures and Algorithms Information Theory We give the first algorithm for adaptive alphabetic prefix-free coding that is worst-case optimal in terms of time and compression when $σ\in o \left( \frac{n^{1 / 2}}{\log n} \right)$, where $σ$ is the size of the alphabet and $n$ is the length of the input. |
| title | Worst-case optimal adaptive alphabetic prefix-free coding |
| topic | Data Structures and Algorithms Information Theory |
| url | https://arxiv.org/abs/2109.02997 |