Huffman coding: Difference between revisions

Revision as of 01:17, 8 June 2024

Revision as of 11:10, 13 June 2024

Line 5:

!Char!!Freq!!Code

|-

|sA |18|2||1011

|space||7||111

|-

|aB |10|4||010

|-

|eC |2|4||000

|-

|fD |2|3||1101

|-

|hE |3|2||1010

|-

|iF |1|2||1000

|-

|mG |5|2||0111

|-

|nH |4|2||0010<ref><ref></ref></ref>

|-

|s ||2||1011

|-

|t ||2||0110

|-

|l ||1||11001

|-

|o ||1||00110

|-

|p ||1||10011

|-

|r ||1||11000

|-

|u ||1||00111

|-

|x ||1||10010

|}]]

In [[computer science]] and [[information theory]], a '''Huffman code''' is a particular type of optimal [[prefix code]] that is commonly used for [[lossless data compression]]. The process of finding or using such a code is '''Huffman coding''', an algorithm developed by [[David A. Huffman]] while he was a [[Doctor of Science|Sc.D.]] student at [[Massachusetts Institute of Technology|MIT]], and published in the 1952 paper "A Method for the Construction of Minimum-Redundancy Codes".<ref>{{Cite journal | last1 = Huffman | first1 = D. |author-link1=David A. Huffman| title = A Method for the Construction of Minimum-Redundancy Codes | doi = 10.1109/JRPROC.1952.273898 | journal = [[Proceedings of the IRE]]| volume = 40 | issue = 9 | pages = 1098–1101 | year = 1952 | url = http://compression.ru/download/articles/huff/huffman_1952_minimum-redundancy-codes.pdf}}</ref>