Description: Programming, Theory, and Math
I needed an ascii compression algorithm that was extremely tiny, allowed random access, and could uncompress data with no memory overhead for embedded systems. This is what I came up with. It is similar to lzss compression except the offset is in compressed space rather than character space. so the anemic 5 bit pointer can actually stretch pretty far in character space and copy from hundreds of characters away.
more information as well as a discussion of the theory can be found here
github repository