Comments on: Huffman Coding http://coder.bsimmons.name/blog/2009/05/huffman-coding/ fragmentary ideas ䷿ intellectual what-nots ䷷ and haskell programming ䷴ Mon, 16 Aug 2010 13:21:24 +0000 http://wordpress.org/?v=2.9.1 hourly 1 By: Boss Resurfacing http://coder.bsimmons.name/blog/2009/05/huffman-coding/comment-page-1/#comment-119 Boss Resurfacing Mon, 07 Sep 2009 02:17:14 +0000 http://coder.bsimmons.name/blog/?p=172#comment-119 Off topic - Help with PM? lost password <a href="http://www.upspring.com/boss-resurfacing-irving-tx-map.html" rel="nofollow">Boss Resurfacing</a> <a href="http://www.fedspending.org/faads/faads.php?recip_id=105716&detail=-1" rel="nofollow">Boss Resurfacing</a> Off topic – Help with PM?
lost password
Boss Resurfacing
Boss Resurfacing

]]> By: Lazy Arrays and the LZ77 Algorithm in Haskell | LAMBDAPHONE http://coder.bsimmons.name/blog/2009/05/huffman-coding/comment-page-1/#comment-87 Lazy Arrays and the LZ77 Algorithm in Haskell | LAMBDAPHONE Thu, 18 Jun 2009 17:32:36 +0000 http://coder.bsimmons.name/blog/?p=172#comment-87 [...] related to the DEFLATE algorithm: the first on run-length encoding, and the second on simple Huffman Coding. This post models the LZ77 algorithm, the second of the two compression strategies used by DEFLATE, [...]

blockquote {
margin: 2em;
padding: .1em 1.5em;
position: relative;
background: #2F2F2F;
}
">

[...] related to the DEFLATE algorithm: the first on run-length encoding, and the second on simple Huffman Coding. This post models the LZ77 algorithm, the second of the two compression strategies used by DEFLATE, [...]

]]> By: jberryman http://coder.bsimmons.name/blog/2009/05/huffman-coding/comment-page-1/#comment-82 jberryman Thu, 11 Jun 2009 18:02:47 +0000 http://coder.bsimmons.name/blog/?p=172#comment-82 @Bart Massey: Thanks, I'm looking forward to checking out your code! @Bart Massey:

Thanks, I’m looking forward to checking out your code!

]]> By: Bart Massey http://coder.bsimmons.name/blog/2009/05/huffman-coding/comment-page-1/#comment-79 Bart Massey Sun, 07 Jun 2009 16:10:24 +0000 http://coder.bsimmons.name/blog/?p=172#comment-79 See http://wiki.cs.pdx.edu/bartforge/rle and http://wiki.cs.pdx.edu/bartforge/huffman for my sample implementations of these functions. Your literate Haskell is much cleaner. My frequency counter maintains a map from symbol to count. I haven't benchmarked it, but I suspect that it's faster than group.sort . Thanks for an interesting post! See http://wiki.cs.pdx.edu/bartforge/rle and http://wiki.cs.pdx.edu/bartforge/huffman for my sample implementations of these functions. Your literate Haskell is much cleaner.

My frequency counter maintains a map from symbol to count. I haven’t benchmarked it, but I suspect that it’s faster than group.sort .

Thanks for an interesting post!

]]> By: Dan Rosén http://coder.bsimmons.name/blog/2009/05/huffman-coding/comment-page-1/#comment-78 Dan Rosén Sun, 07 Jun 2009 09:59:29 +0000 http://coder.bsimmons.name/blog/?p=172#comment-78 Frequency distribution: freq = map (head &&& length) . group . sort > freq "the quick brown fox jumps over the lazy dog's back" [(' ',9),('\'',1),('a',2),('b',2),('c',2),('d',1),('e',3),('f',1),('g',1),('h',2),('i',1),('j',1),('k',2),('l',1),('m',1),('n',1),('o',4),('p',1),('q',1),('r',2),('s',2),('t',2),('u',2),('v',1),('w',1),('x',1),('y',1),('z',1)] Nice tutorial :) Frequency distribution:

freq = map (head &&& length) . group . sort

> freq “the quick brown fox jumps over the lazy dog’s back”
[(' ',9),('\'',1),('a',2),('b',2),('c',2),('d',1),('e',3),('f',1),('g',1),('h',2),('i',1),('j',1),('k',2),('l',1),('m',1),('n',1),('o',4),('p',1),('q',1),('r',2),('s',2),('t',2),('u',2),('v',1),('w',1),('x',1),('y',1),('z',1)]

Nice tutorial :)

]]>