Re: huffman encoding

Article View: comp.sys.amiga.tech

Article #1495

Back to comp.sys.amiga.tech Previous Next

#1495

From: Roger Uzun
Date: Mon, 02 Oct 1989 22:16

13 lines
814 bytes

Of course i realize that the huffman tree for a file that has
256 unique elements is not optimal for files that have less than that,
but I am trying to simplify things a bit.
 
So I should have asked for the huffman bit patterns and bit counts
for the constant encoding tree that would be used on files that
have 256 unique elements.

-Roger uzun

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

Technical Details

Message-ID: <467@crash.cts.com>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!uwm.edu!bionet!sdsu!crash!pnet01!uzun

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!uwm.edu!bionet!sdsu!crash!pnet01!uzun
From: uzun@pnet01.cts.com (Roger Uzun)
Newsgroups: comp.sys.amiga.tech
Subject: Re: huffman encoding
Message-ID: <467@crash.cts.com>
Date: 2 Oct 89 22:16:27 GMT
Sender: root@crash.cts.com
Organization: People-Net [pnet01], El Cajon CA
Lines: 13