Text Compression using Huffman codingCode … mapping of each character to a binary code word Prefix code … binary code such that no code word is prefix of another code word Encoding tree …
Text compression problem Given a text T, find a prefix code that yields the shortest encoding of T
|