Bad implementations of data compression algorithms in Haskell
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Callum David OBrien 4a8ea6d7bb Tabs considered harmful (O'Donnell 2017) 2 years ago
.gitignore Initial commit 2 years ago
LICENSE Initial commit 2 years ago
Makefile Initial commit 2 years ago
README Tabs considered harmful (O'Donnell 2017) 2 years ago
arith.hs Initial commit 2 years ago
bwt.hs Implemented (non-bijective) BWT 2 years ago
cpress.1 Initial commit 2 years ago
cpress.hs Initial commit 2 years ago
cpress.mk Initial commit 2 years ago
del.hs Initial commit 2 years ago
huff.hs Initial commit 2 years ago
lz.hs Initial commit 2 years ago

README

I'm going to try and implement a few data compression algorithms in
Haskell, and the sources are... Here (TM)! The algorithms I'm
currently planning on implementing are:

Arithmetic compression
the Burrows-Wheeler Transform
Delta encoding
Huffman encoding

I think I might chain a few of these together and make a bytestream
compression tool, but talk is cheap and I have no code.

cdo