The algorithm allows any kind of weights (costs, frequencies), including non-numerical ones. The {0, 1, ..., n-1} alphabet is used to encode message. Built tree is n-ary one.The algorithm is based on a set of template classes : Cell(SYMBOL, WEIGHT), Node(
Release Date:
Topics:
License:
Ratings and Reviews
Be the first to post a text review of n-ary Huffman Template Algorithm. Rate and review a project by clicking thumbs up or thumbs down in the right column.
Project Feed
-
huffman-ta Version 3.0 file released: huffman-ta-src-3-0.zip
-
huffman-ta Version 3.0 file released: huffman-ta-src-3-0.tar.bz2
-
huffman-ta Version 3.0 file released: huffman-ta-exe-3-0.zip
-
huffman-ta Version 3.0 file released: huffman-ta-exe-3-0.tar.gz
-
huffman-ta Version 3.0 file released: huffman-ta-exe-3-0.tar.bz2
-
n-ary Huffman Template Algorithm : Release 3.0
------------------------ 2004-11-08 : Release 3.0 ------------------------ n-ary Huffman Template Algorithm : Release 3.0 s now available at http://sourceforge.net/projects/huffman-ta/ Changes from 2.3 to 3.0 ----------------------- 1. The n-ary Huffman Template Algorithm has been compiled with the following compilers : * GNU gcc/gpp 3.4.1 (Djgpp). 2. Building Length Lmited Huffman tress has been added.
-
File released: /huffman-ta/Version 3.0/huffman-ta-exe-3-0.zip
-
File released: /huffman-ta/Version 3.0/huffman-ta-exe-3-0.tar.bz2
-
File released: /huffman-ta/Version 3.0/huffman-ta-exe-3-0.tar.gz
-
File released: /huffman-ta/Version 3.0/huffman-ta-src-3-0.tar.bz2
Rate and Review
Be the first person to add a text review.
Related Projects
n-ary Huffman Template Algorithm Actions
About SourceForge
Develop Software
Copyright © 2009 Geeknet, Inc. All rights reserved. Terms of Use
