4 ms·
No, you can't. Consider applying your compression algo twice, or N times. If it gets smaller each time, then eventually you could compress anything to a single
by beecafe 5y ago
No, you can't. Consider applying your compression algo twice, or N times. If it gets smaller each time, then eventually you could compress anything to a single bit.
- unnouinceput 5y agoYou can't apply this method twice. Please understand this particular compression type is unique to a single given fixed set of data. That's it! It's not a general compression method, is custom made for that data only. And it takes time to research it to achieve that extreme compression.
- anonymoushn 5y agoIt doesn't work. If it did work, you could apply it separately to every string containing 100 bits and end up with 2^100 separate strings containing fewer than 100 bits, each of which decodes to a unique 100-bit string.
- unnouinceput 5y agoYou're still missing the point. Please read the edit I made to root comment.
- anonymoushn 5y agoYou're still wrong. A data generator is a program that runs on some computer. Programs are strings with lengths. If you'd like to use a purpose-built computer or decoder for each output, then you need to include the complexity of the computer or decoder in the compressed size. Otherwise you could write a decoder such as "when given any input, output the contents of wikipedia" and claim that it compresses a certain text to 0 bytes.
- beecafe 5y agoIf your compression algorithm worked for just one fixed set of data, then you could just store that fixed data in the decompressor and achieve infinity compression of the data to 0 bits.