Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!gem.mps.ohio-state.edu!ginosko!ctrsol!sdsu!crash!pnet01!uzun
From: uzun@pnet01.cts.com (Roger Uzun)
Newsgroups: comp.sys.amiga.tech
Subject: Re: huffman encoding
Message-ID: <476@crash.cts.com>
Date: 4 Oct 89 14:16:07 GMT
Sender: root@crash.cts.com
Organization: People-Net [pnet01], El Cajon CA
Lines: 17


Well, I did not say that they occur with equal frequency.  In fact if there
are 256 unique bytes in the file 255 may occur only once or there may
be equal distribution but the bit patterns and bit lengths for the
1st...256th most common bytes will be constant in any case.  i am 
finding it difficult to easily create a table of bit patterns and bit
lengths in the patterns from a file.  I thought if i had the 256 unique
byte case as a constant things would be less than optimal but easy to
do.  Do you have any suggestions on an algorithm for creating
a data structre that has the bit patterns/bit lengths for a given
file?
Thanks
-Roger

UUCP: {hplabs!hp-sdd ucsd nosc}!crash!pnet01!uzun
ARPA: crash!pnet01!uzun@nosc.mil
INET: uzun@pnet01.cts.com