Jump to content

Huffman coding: Revision history

External tools:

Here you can take a look at older versions of this page, and compare different versions.

  • Click the date to see an old version.
  • To compare two versions (changes), click the circles (in separate columns) next to them. Then click the Compare button to see the differences between them.
  • You can use (cur) to compare an old version with the newest (or current) one. You can use (last) to compare any version with the one just before it.
  • The letter m next to a change means that the change was marked as small (or minor).

16 February 2023

14 February 2023

8 February 2023

  • curlast 22:5622:56, 8 February 2023 Eptalon talk changes 4,427 bytes +4,427 Created page with "File:Huffman_tree_2.svg|thumb|Huffman tree generated from the exact frequencies of the text "this is an example of a huffman tree". The frequencies and codes of each character are below. Encoding the sentence with this code requires 135 (or 147) bits, as opposed to 288 (or 180) bits if 36 characters of 8 (or 5) bits were used. (This assumes that the code tree structure is known to the decoder and thus does not need to be counted as part of the transmitted information.)..." Tag: Visual edit
Retrieved from "https://simple.wikipedia.org/wiki/Huffman_coding"