A Modified Huffman Procedure with Reduced Memory Requirement

The usual Huffman procedure for source coding requires a codebook memory for translation of the source messages into variable-length codewords. When some of the source messages are highly improbable, the size of the required codebook becomes very large. This correspondence proposes a modification of the Huffman procedure to reduce the size of the required memory under those conditions.