An algorithm for optimal prefix parsing of a noiseless and memoryless channel
Abraham Lempel, Shimon Even, M. Cohn · IEEE Transactions on Information Theory · 1973
We discuss the prefix encoding of aQ-ary source(Q \geq 2)into anL-symbol channel alphabet withL \geq 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.