+Huffman coding is a widely used [Lossless Compression](/wiki/lossless_compression) algorithm. It constructs a unique [Prefix Code](/wiki/prefix_code) for each symbol, assigning shorter bit sequences to more frequent characters to achieve optimal data reduction.
+## See also
+- [Data Compression](/wiki/data_compression)
+- [Greedy Algorithm](/wiki/greedy_algorithm)
+- [Information Theory](/wiki/information_theory)
... 1 more lines