Some notes on fix-free codes

A variable-length code is called a fix-free code if it is both prefix-free and suffix-free. In this paper, we consider some basic properties of fix-free codes. We obtain one lower and one upper bound on the redundancy of the optimal fix-free code. Comparing these bounds, we derive an upper bound on the length of the most likely source symbol in terms of its probability.