home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #16 / NN_1992_16.iso / spool / comp / compress / 2767 < prev    next >
Encoding:
Text File  |  1992-07-21  |  666 b   |  17 lines
  1. Newsgroups: comp.compression
  2. Path: sparky!uunet!cs.utexas.edu!torn!watserv1!watmath!bbobak
  3. From: bbobak@math.waterloo.edu (Brad Bobak)
  4. Subject: sizing huffman trees
  5. Message-ID: <1992Jul21.220205.18507@math.waterloo.edu>
  6. Organization: University of Waterloo
  7. Date: Tue, 21 Jul 1992 22:02:05 GMT
  8. Lines: 7
  9.  
  10.   I was wondering if anyone has come up with an algorithm for determining
  11.  the size of an encoded huffman tree from just the frequencies of the
  12.  letters (sorted or unsorted, it doesn't matter).
  13.   Right now, to size a tree, I'm basically building it, and this is time
  14.  consuming if I'm using alot of trees.
  15.   Any pointers, suggestions, etc. would be appreciated.
  16.  
  17.