For a given character distribution, by assigning short codes to frequently occurring characters and longer codes to infrequently occurring characters, Huffman’s minimum redundancy encoding minimises the average number of bytes required to represent the characters in a text.
