File compression
Lossless file compression algorithms implemented with Rust. At the base of each compression is a static huffman-coding of all bytes. To reduce file size further, a burrows-wheeler- and move-to-front transformation are applied to input files before applying the static compression. This is the same concept behind bzip2.
Resources
- Source Code
- https://github.com/I-mikan-I/rust-compression
- Huffman-Coding Explainer
- https://medium.com/@mikn/file-compression-in-rust-huffman-coding-1a6092c27e17
- Burrows-Wheeler Transformation Explainer
- https://medium.com/@mikn/file-compression-in-rust-2-burrows-wheeler-transform-6d911b8dfc8d
- Move-To-Front Transformation Explainer
- https://medium.com/@mikn/file-compression-in-rust-3-move-to-front-transform-77a104937cb5