Huffman Encoding in Haskell

I guess that after doing run-length encoding, the next logical step was Huffman encoding. Find my project at BartForge. It encodes and decodes about 2M symbols per second on my fast box.

I'm slowly learning how to optimize Haskell. Bleah. Friend of Bart

By Bart at 2008-05-10 17:43
BartForge
Bart's blog

Post new comment

Your name:

E-mail:

The content of this field is kept private and will not be shown publicly.

Homepage:

Subject:

Comment: *

Input format

BBCode

Textual smileys will be replaced with graphical ones.
Allowed HTML tags: <a> <em> <strong> <cite> <code> <ul> <ol> <li> <dl> <dt> <dd> <p> <h2> <h3> <blockquote>
Lines and paragraphs break automatically.

Restricted HTML

Allowed HTML tags: <a> <em> <strong> <cite> <code> <ul> <ol> <li> <dl> <dt> <dd> <b> <i>
Lines and paragraphs break automatically.
Textual smileys will be replaced with graphical ones.
Web page addresses and e-mail addresses turn into links automatically.

Markdown

You can use Markdown syntax to format and style the text.
Textual smileys will be replaced with graphical ones.

More information about formatting options

CAPTCHA

This question is for testing whether you are a human visitor to prevent automated spam submissions.

What code is in the image?: *

Copy the characters (respecting upper/lower case) from the image.

FOB

Navigation

User login

Syndicate

Huffman Encoding in Haskell

Post new comment