Note: On the construction of prefix-free and fix-free codes with specified codeword compositions

Authors:
Ali Kakhbod;Morteza Zadimoghaddam
Affiliations:
Department of Electrical Engineering and Computer Science (EECS), University of Michigan, Ann Arbor, MI, USA;Computer Science and Artificial Intelligence Laboratory (CSIL), MIT, Cambridge, MA, USA
Venue:
Discrete Applied Mathematics
Year:
2011

Citing 6
Cited 0

Codes: Unequal Probabilities, Unequal Letter Cost

Journal of the ACM (JACM)
On Minimum-Redundancy Fix-Free Codes

DCC '09 Proceedings of the 2009 Data Compression Conference
A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs

IEEE Transactions on Information Theory
Some basic properties of fix-free codes

IEEE Transactions on Information Theory
Conjectures on uniquely decipherable codes (Corresp.)

IEEE Transactions on Information Theory
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.04

Visualization

Abstract

We investigate the construction of prefix-free and fix-free codes with specified codeword compositions. We present a polynomial time algorithm which constructs a fix-free code with the same codeword compositions as a given code for a special class of codes called distinct codes. We consider the construction of optimal fix-free codes which minimize the average codeword cost for general letter costs with uniform distribution of the codewords and present an approximation algorithm to find a near optimal fix-free code with a given constant cost.