A sodoku puzzle(requiring only 17 digits for an unique solution) which has an single solution isn't exactly useful for compression.
How I am thinking about this? The article states:
"And since for a 256 x 256 image, there are at least 256!=2^1684 possible Sudoku matrices, it's not easy for an adversary to hit on the solution by accident or even by brute force. "
Compression would make sense if the number of puzzles was something like 1684, but it is here 2^1684!! Which is quite a lot and to be decoded would be even worse than the image itself.
The sodoku puzzle's compression would not be of any practical use not only because they give the data more problems to account for but also because the data would need to be interpreted.
Also anything that uses encryption generally does the complete opposite of compression.
For sure it increases the computational power required to decompress, but that does not preclude its usefulness. Sometimes computation is cheap and bandwidth is expensive, as perhaps when sending messages to distant stars.
A sodoku puzzle(requiring only 17 digits for an unique solution) which has an single solution isn't exactly useful for compression.
How I am thinking about this? The article states:
"And since for a 256 x 256 image, there are at least 256!=2^1684 possible Sudoku matrices, it's not easy for an adversary to hit on the solution by accident or even by brute force. "
Compression would make sense if the number of puzzles was something like 1684, but it is here 2^1684!! Which is quite a lot and to be decoded would be even worse than the image itself.
The sodoku puzzle's compression would not be of any practical use not only because they give the data more problems to account for but also because the data would need to be interpreted.
Also anything that uses encryption generally does the complete opposite of compression.