Exactly two years ago I wrote Kwc compressor for fun as spin-off from a program I wrote to count fix length keywords in text files.
Kwc take every time 6 bytes as "keyword" string and do not store double keywords in output but the unique ID from the already found keyword.
The only novel thing I put in is what I called "gear encoding" what only give gain with unsorted but slowly incurring values ranges.
It's written in Visual Basic 2008 and need Framework 3.5 to run.
It run under Windows as GUI and under command line mode 32 and 64bit.
Command line syntax:
Compress: kwc c input output
Decompress: kwc d input output
Memory usage depends on input file size and unique keywords found I think round 0,5-1,5x times input file size for compression and half of it for decompression.
It can often run recursive 3-6 times till gain stop.
I didn't build in full error handling so when there are to much round 36mln+ unique keywords found in a input file it crash with an overflow. This often happened when input file is >1GB and/or random or already compressed.
Download:
http://www.metacompressor.com/download/kwc.zip
Maybe Matt can tested it at the LTB and GCB so I can compare it against BPE2 what's also a dictionary type compressor.