1 unstable release
Uses old Rust 2015
0.1.0 | Mar 14, 2016 |
---|
#30 in #huffman
8,029 downloads per month
6KB
119 lines
This is a Rust implementation of the package-merge algorithm. It's used to compute optimal length-limited prefix codes for data compression.
lib.rs
:
This crate implements the package-merge algorithm. The package-merge algorithm is able to compute an optimal length-limited prefix-free code. As such, it might be useful for data compression purposes much like the Huffman algorithm. But Huffman's algorithm does not allow you do constrain the maximum length of all code words.
Dependencies
~420KB