arXiv
Open Access
2021
Worst-case optimal adaptive alphabetic prefix-free coding
Travis Gagie
Abstrak
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.
Penulis (1)
T
Travis Gagie
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2021
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓