For Programmers: Free Programming Magazines  


Home > Archive > Compression > December 2005 > [Question] DEFLATE Huffman Codes









You are viewing an archived Text-only version of the thread. To view this thread in it's original format and/or if you want to reply to this thread please [click here]

 

Author [Question] DEFLATE Huffman Codes
George Wilson

2005-11-29, 7:55 am

I have gone through zlib standard implementation of DEFLATE [RFC1951].
I am more specific about the Dynamic Huffman codes.

I have gone through the DEFLATE for generating a compressed dynamic
Huffman codes for the given data. I need any resource on the web which
would explain DEFLATE crystal clear.


Question:
1. How base values are generated for the code length generated using
Huffman trees and extra bits.

2. How code lengths are constrained to 15 bits

3. Apart from the zlib implementation is there any simple
implementation of deflate.

4. Any resource on the web, explaining deflate very clearly or any
other related information will be appreciated.



George Wilson

Ben Rudiak-Gould

2005-11-29, 6:55 pm

George Wilson wrote:
> 3. Apart from the zlib implementation is there any simple
> implementation of deflate.


There is an implementation in PuTTY[1] which isn't based on the zlib code. I
think it uses static Huffman tables, though.

-- Ben

[1] http://www.chiark.greenend.org.uk/~sgtatham/putty/
Ojala Pasi 'Albert'

2005-12-02, 8:50 pm

On 2005-11-29, George Wilson <george_wilson_mit@yahoo.com> wrote:
> 3. Apart from the zlib implementation is there any simple
> implementation of deflate.


Check out http://www.iki.fi/a1bert/Dev/gunzip/ and puzip/

-Pasi

Sponsored Links







Also available: Server administration forum archive | Web Design forum archive | Software forum archive | Hardware reviews archive

Copyright 2008 codecomments.com