Can error correction codes be an entertaining game?

Question

Whenever I play Sudoko, I see the finished puzzle as an over-described version of the original input. Like 8b / 10b, Reed-Solomon codes, turbo codes, or low-density parity codes. Using ECC, the computer must solve the puzzle to get the correct data, and from sudoku, the person must solve the puzzle to produce 81 digits of pleasure.

Do you think any of these ECC codes will be a good pencil and paper game? (8b / 10b - home version!)

Is there a good way to present data in Sudoku puzzles to make the funniest access to ECC?

Answer 1

Presenting arbitrary data as a sudoku puzzle is not particularly possible because the total number of sudoku nets (and therefore the number of individual pieces of information that can be represented by the puzzle) is too low (approximately 6E21) to encode a significant amount of data (more than 9 bytes).

Add to this the computational difficulty of creating an unambiguous puzzle for a given solution and the wide data density of an optimal puzzle for different solutions.

Answer 2

Another way to look at the redundant specification in the final result is to consider the initial state as a result of the compression algorithm.

Nonograms is another example of a very informatively sparse result presented in the form of an information-dense puzzle.