View Code? Open in Web Editor
NEW
implementation of Burrows-Wheeler Transformation and Run Length Encoding
simple-compression-algorithm's Introduction
simple-compression-algorithm
- implementation of Burrows-Wheeler Transformation and Run Length Encoding.
- optimized BWT to run in linear time.
- optimized RLE by using 2 letters to denote a run.
- run either
node index.js enocde test.txt
or node index.js decode test.txt
- all the compressed files are stored in output folder and uncompressed in input folder.
- to compress a file first place it in input folder.
- becomes slow after 32 MB (need to optimize I/O handling)
- fails in cases where there are large amount of numbers due to RLE
simple-compression-algorithm's People
Contributors
Stargazers
Watchers