Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!ucbvax!agate!eris.berkeley.edu!mwm
From: mwm@eris.berkeley.edu (Mike (I'll think of something yet) Meyer)
Newsgroups: comp.sys.amiga.tech
Subject: Re: huffman encoding
Message-ID: <1989Oct4.233204.17615@agate.berkeley.edu>
Date: 4 Oct 89 23:32:04 GMT
References: <476@crash.cts.com>
Sender: usenet@agate.berkeley.edu (USENET Administrator;;;;ZU44)
Reply-To: mwm@eris.berkeley.edu (Mike (I'll think of something yet) Meyer)
Organization: Missionaria Phonibalonica
Lines: 20

In article <476@crash.cts.com> uzun@pnet01.cts.com (Roger Uzun) writes:
<
<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.

This is false. If the first most common byte occurs > 50% of the time,
it will have a one-bit encoding. If the 256 codes occur evenly enough,
every code will be eight bits long.

	<mike



--
Es brillig war. Die schlichte Toven			Mike Meyer
Wirrten und wimmelten in Waben;				mwm@berkeley.edu
Und aller-mumsige Burggoven				ucbvax!mwm
Die mohmem Rath' ausgraben.				mwm@ucbjade.BITNET