A Characterization of Optimal Prefix Codes

2023/11/13 by Congero, Spencer, Zeger, Kenneth
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2311.07007

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.

Related

• On the Relationships among Optimal Symmetric Fix-Free Codes
• Optimal Prefix Codes with Fewer Distinct Codeword Lengths are Faster to Construct
• Tight Bounds on Minimum Maximum Pointwise Redundancy
• Reserved-Length Prefix Coding
• Lossless Coding with Generalised Criteria