Key points are not available for this paper at this time.
We discuss the prefix encoding of a Q -ary source (Q 2) into an L -symbol channel alphabet with L Q. We present an optimal encoding scheme that minimizes the expected cost per symbol in the case of equally probable source symbols and arbitrary channel symbol costs.
Lempel et al. (Thu,) studied this question.