AriComp 1.0
This is a little console mode utility program which is able to (de-)compress single files with a static Arithmetic compression algorithm. You could easily add the RLE/BWT/MFT data transformation algorithms. Just rip the corresponding classes out of my HuffComp source code. I won't add these ones...
Basic Huffman Coding
This program generates binary Huffman codes for a group of symbols. INPUT : Probabilities of symbols OUTPUT : Huffman code corresponding to each probability It DOES NOT generate a Huffman-coded binary file from a text file.If needed,the program can be easily modified to include such a feature.
Basic Huffman Coding using Minimum Variance Method
This program generates the binary Huffman code of a group of symbols using Minimum Variance method. INPUT: probabilities of the symbols OUTPUT: Binary Minimum variance Huffman codes It DOES NOT generate a binary file from a text file.If needed the program can be easily modified to achieve this.
CCMPRS
A command-line file compression utility for Windows NT. It allows you to select files for NTFS file compression based on file name (with wild- cards), minimum file size, and/or a minimum compression ratio. You can also specify file extensions of files to be ignored. With C++ src
HiP Compressor BETA 1
My (so called) HiP compression algorithm as console mode utility. It's a hybrid of Lempel-Ziv 77 and Adaptive Huffman encoding (Huffman + LZ77 ZIP = HiP) with a word prefix hash algorithm etc.
HuffComp 1.3
This little console mode tool compresses and decompresses files on a per byte scheme with a pure adaptive Huffman compression algorithm. Addionally the input buffer is pre-/postprocessed by the RLE/MFT/BWT data transformation algorithms and symbols, occurred recently, have smaller bit sequences ...
Huffman Encoder/Decoder
Encode/Decode data using the Huffman Tree algorithm. See the attached document for a detailed description. Most of the code is not documented. However, if you need to submit an OO assignment, and can choose any general subject (or this one in particular), than this project is a good piece of wor...
N-ary Huffman Template Algorithm v2.2
N-ary Huffman algorithm uses the {0, 1, ..., n-1} alphabet to encode message. Built tree is n-ary one. Huffman template algorithm enables to use non-numerical weights (costs, frequences).
Software Development Targets corporate developers and technical managers working at mainly mid- to large-size companies with sizable development staffs....
subscribe now
Files
