A Characterization of Optimal Prefix Codes
Information Theory
2024-04-11 v3 math.IT
Abstract
A property of prefix codes called strong monotonicity is introduced, and it is proven that for a given source, a prefix code is optimal if and only if it is complete and strongly monotone.
Keywords
Cite
@article{arxiv.2311.07007,
title = {A Characterization of Optimal Prefix Codes},
author = {Spencer Congero and Kenneth Zeger},
journal= {arXiv preprint arXiv:2311.07007},
year = {2024}
}