|
|
|
|
|
|
by Animats
1835 days ago
|
|
|
Lempel-Ziv compression is used by some file compression utilities.[1] The ratio of original size to compressed size is essentially the Lempel-Ziv complexity. If you compress a file of AAAAAAAA..., you will get a very small file, and a low complexity. If you compress a file of random numbers, the file will not compress much, if at all, and you get a high complexity. "Lempel-Ziv complexity is the number of different sub-strings (or sub-words) encountered as the binary sequence is viewed as a stream (from left to right)"[2] This leads to a compression algorithm. [1] https://en.wikipedia.org/wiki/Lempel%E2%80%93Ziv%E2%80%93Wel... [2] https://en.wikipedia.org/wiki/Lempel-Ziv_complexity |
|
|