Sobre a Eficiência da Codificação de Huffman Binária em Extensões de Fontes de Informação

This paper investigates, in a preliminary way, the behavior of the efficiency of binary Huffman codes applied to memoryless sources with three symbols in its alphabet and its extensions. It was observed that, similarly to the case where source and code alphabets have the same cardinality, there is not always gain in efficiency of the Huffman coding by increasing the order of the source extension, when using binary codes to map sources with alphabet with three symbols.