Re: huffman encoding

Article View: comp.sys.amiga.tech

Article #1519

Back to comp.sys.amiga.tech Previous Next

#1519

From: Roger Uzun
Date: Wed, 04 Oct 1989 14:36

14 lines
932 bytes

What I was saying was that the bit patterns/bit lengths of the codes used
to represent the tokens in a file where there are 256 unique tokens is a
constant and will work for all files.  that is the table I wanted.
-Roger

It is true that the bit patterns and bit lengths used to represent tokens
varies depending on # of unique tokens in a file, but if that # is assumed
to be 256, you have no problem.
-Roger

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

Technical Details

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

Path:

arc1-ca.pugleaf.net!utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!gem.mps.ohio-state.edu!ginosko!ctrsol!sdsu!crash!pnet01!uzun

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!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: <477@crash.cts.com>
Date: 4 Oct 89 14:36:04 GMT
Sender: root@crash.cts.com
Organization: People-Net [pnet01], El Cajon CA
Lines: 14