Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression. It's usually implemented via a greedy approach.