Data-Compression.org

data compression link collection

A Memory-Efficient Huffman Adaptive Coding Algorithm for Very Large Sets of Symbols

This paper describes an adaptive Huffman scheme that is designed to work with large numbers of symbols - at least that’s what the abstract says. The web page indicates that there are executables in the archive, but all I see is a Word document.

http://www.iro.umontreal.ca/~pigeon/programs/programs.html#huffman

         

Posted in March 10th, 2003

No User Commented In " A Memory-Efficient Huffman Adaptive Coding Algorithm for Very Large Sets of Symbols "

Subscribes to this post Comment RSS or TrackBack URL

Leave Your Reply Below

 Username

 Email Address

 Website

Sticky note: Please double check your comments before submit Please Note: The comment moderation maybe active so there is no need to resubmit your comment