Worst-case optimal adaptive alphabetic prefix-free coding
Data Structures and Algorithms
2026-01-08 v5 Information Theory
math.IT
Abstract
We give the first algorithm for adaptive alphabetic prefix-free coding that is worst-case optimal in terms of time and compression when , where is the size of the alphabet and is the length of the input.
Cite
@article{arxiv.2109.02997,
title = {Worst-case optimal adaptive alphabetic prefix-free coding},
author = {Travis Gagie},
journal= {arXiv preprint arXiv:2109.02997},
year = {2026}
}