n-ary Huffman Template Algorithm

To: aofa@pommard.inria.fr
Subject: n-ary Huffman Template Algorithm
From: Alex Vinokur <alexander.vinokur@telrad.co.il>
Date: Sun, 29 Aug 1999 11:44:57 +0300
Content-Transfer-Encoding: 7bit
Content-Type: text/plain; charset=us-ascii
Organization: Telrad Ltd.
Reply-To: Alex Vinokur <alexander.vinokur@telrad.co.il>
Sender: alexv@tibamsun8.telrad.co.il

Hi,

n-ary Huffman Template Algorithm has been written (C++, STL).


1. n-ary Huffman algorithm uses
   the {0, 1, ..., n-1} alphabet to encode message.
   Built tree is n-ary one.

2. Huffman template algorithm enables
   to use non-numerical weights (costs, frequences).


See http://alexvn.homepage.com/alexvn.html

        Alex Vinokur

Prev by Date: Applet for Animation of String Matching Algorithms
Next by Date: Call for papers!! Algorithmica again!!
Prev by thread: Applet for Animation of String Matching Algorithms
Next by thread: n-ary Huffman Template Algorithm
Index(es):
- Date
- Thread

Date Prev | Date Next | Date Index | Thread Index