packagemerge 0.1.0

Implementation of the package-merge algorithm for data compression. It solves a problem similar to problem Huffman's algorithm solves: Computing a prefix-free code. But the package-merge algorithm does it while satisfying an additional constraint: a maximum code word length.

Documentation

This is a Rust implementation of the package-merge algorithm. It's used to compute optimal length-limited prefix codes for data compression.