Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!eternal-september.org!feeder.eternal-september.org!news.stack.nl!.POSTED!not-for-mail
From: Willem <willem@turtle.stack.nl>
Newsgroups: comp.compression
Subject: Re: Using various kinds of frequencies
Date: Mon, 24 Sep 2012 21:25:46 +0000 (UTC)
Organization: Stack Usenet News Service
Lines: 19
Message-ID: <slrnk61juq.5tf.willem@turtle.stack.nl>
References: <k3jvmf$hod$1@news.albasani.net> <k3p7go$43o$1@news2.informatik.uni-stuttgart.de> <k3qiej$noo$1@news.albasani.net>
NNTP-Posting-Host: turtle.stack.nl
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
X-Trace: mud.stack.nl 1348521946 25001 2001:610:1108:5010::132 (24 Sep 2012 21:25:46 GMT)
X-Complaints-To: abuse@stack.nl
NNTP-Posting-Date: Mon, 24 Sep 2012 21:25:46 +0000 (UTC)
User-Agent: slrn/0.9.9p1 (FreeBSD)
Xref: csiph.com comp.compression:1527

Mok-Kong Shen wrote:
) I mean the following: An 8-bit byte has a coding space of 256. One could
) allocate a part of it to code some high frequency words, another part
) to code some high frequency digraphs and the rest to code the
) alphabetical characters. I assume also that these frequencies are
) known (averages of natural language texts). I like to know whether
) that would result in some compression that is not too bad as compared
) to, say, Huffman applied to single characters as usual.

Probably.  It's like Lempel-Ziv compression, but with a fixed dictionary.


SaSW, Willem
-- 
Disclaimer: I am in no way responsible for any of the statements
            made in the above text. For all I know I might be
            drugged or something..
            No I'm not paranoid. You all think I'm paranoid, don't you !
#EOT