Actually even that is not feasible: Assume that you split a m byte string into k byte decompressor and l byte input data. If k+l < m, that is you actually comp

Actually even that is not feasible: Assume that you split a m byte string into k byte decompressor and l byte input data. If k+l < m, that is you actually compress, then there are only 2^(k+l) possible output strings. And since sum_{i=0}^{m-1} 2^i = 2^m -1 there exists at least one string in the space of m character strings which can not be compressed by any algorithm.