6-Bit Binary Compression

From Jasenko Dzinleski:

This is a fast compression routine based on a 4-byte data word translation via 6-bit bit parity table. 6 bit table entries were computed by omitting last two bits (having decimal values 1 and 2) in a single byte (0 to 255) giving 64 index entries combination (s) per data byte. Also all truncation entries from a 4-byte data word have only 256 combination(s). The 4 6-bit (truncated) dictionary entries are (re)indexed and written to a compressed data output file in a truncated index number order having (binary) length(s) from 7 to 18 bits compared to the original data 32 bit (word) length.