Algorithms for Lossless Compression

This Applet simulates three compression algorithms belonging to the group of lossless compression.
You can choose between the following algorithms:

• Huffman-Code (HC)
• Lempel-Ziv-Welch-Code (LZW)
• Arithmetic Coding (AC)

1. Choose a compression algorithm
2. Enter a text to encode and decode according to the following rules:
   • The string must contain between 3 and 18 letters.
   • Only ASCII-letters can be entered (A-Z, a-z), no umlauts or other characters.
   • The string must contain at least 2 different letters. (HC and AC only)
   • The string must contain at most 12 different letters. (AC only)
3. Press Start-Button

Attention! If your browser is not able to display the applet, you probably need the Java ^TM Plug-in 1.3. It is available at http://java.sun.com/products/plugin/index.html for Linux, Solaris and Windows.

Please feel free to mail us your comments to the applet. We look forward to your opinion.

The source code is available, but not public. Please contact Julia Peterwitz for the source code of the applet.