A Characterization of Optimal Prefix Codes

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.

Authors

Institutions

Publication Details

Journal
Entropy
Published
2024-11-21
DOI
https://doi.org/10.3390/e26121000
Citations
1
Primary Topic
Algorithms and Data Compression
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Characterization of Optimal Prefix Codes

Kenneth Zeger, Spencer Congero
1 citations
Entropy
Algorithms and Data Compression
0.35
article

A Characterization of Optimal Prefix Codes

Kenneth Zeger, Spencer Congero
article en
1 citations

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.

EntropyVol. 26(12)
University of California San Diego (US)
Openalex Percentile: Top 31%
Algorithms and Data Compression
0.35
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Characterization of Optimal Prefix Codes — Kenneth Zeger, Spencer Congero · Entropy (2024) | TGRS Research Map | TGRS