#huffman #data #merge #package

packagemerge

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.

1 unstable release

Uses old Rust 2015

0.1.0 Mar 14, 2016

#33 in #huffman

Download history 2745/week @ 2024-09-01 4316/week @ 2024-09-08 3653/week @ 2024-09-15 3866/week @ 2024-09-22 6006/week @ 2024-09-29 6097/week @ 2024-10-06 3463/week @ 2024-10-13 4172/week @ 2024-10-20 4348/week @ 2024-10-27 3901/week @ 2024-11-03 2306/week @ 2024-11-10 2197/week @ 2024-11-17 1735/week @ 2024-11-24 1643/week @ 2024-12-01 3598/week @ 2024-12-08 2594/week @ 2024-12-15

9,758 downloads per month

MIT/Apache

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