Optimum ’1’ — Ended binary prefix codes
We have investigated the problem of finding a binary prefix code of minimum average code word length for a given finite probability distribution subject to the requirement that each code word must end with a ’1’. We give lower and upper bounds to the performance of the optimum code for any information source; the lower bound is tight in some cases. We also describe an algorithm that generates an optimum code for any information source.
KeywordsTerminal Node Code Word Optimum Code Potential Classis Huffman Code
Unable to display preview. Download preview PDF.