Data-Compression.org

data compression link collection

Self-similar Huffman Trees with Extreme Guessing Propertie

Published in Huffman Coding, Tutorials, Reference, Presentations

An article by John Pliam. Needs a better summary, but I don’t quite get it, other than the fact that there is some cryptographic thinking going on here.

http://www.ima.umn.edu/~pliam/doc/huff/

         

admin
Posted in May 4th, 2003

No User Commented In " Self-similar Huffman Trees with Extreme Guessing Propertie "

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