From: Alex Plantema (alex.plantema@xs4all.nl)
Date: Sat Feb 12 2011 - 14:55:23 CST
On Saturday 12 February 2011 10:11, William_J_G Overington wrote:
> I am wondering if the idea that is behind some recent threads is to
> have a compression system that is like an extended version of the
> second format above, using codes of 00, 0100, 0101, 0110, 011100,
> 0011101, 0011110, 001111100, 001111101 and so on. Or maybe some other
> list such as 00, 010000, 010001, 010010, 010011, 010100 and so on? Or
> maybe some other list?
This is known as Huffman encoding,
see e.g. http://www.huffmancoding.com/my-family/my-uncle/huffman-algorithm
or http://www.cs.sfu.ca/cs/CC/365/li/squeeze/Huffman.html
Morse code also uses the shortest codes for the most frequent characters,
see http://en.wikipedia.org/wiki/Morse_code
What these methods have in common is their decoding tree.
Alex.
This archive was generated by hypermail 2.1.5 : Sat Feb 12 2011 - 14:59:44 CST