What error-correcting coding algorithms can be used to transmit encrypted messages?

Question

Algorithms

Hello! For my thesis, I need to perform such a task.
As you know, block encryption algorithms (such as AES) themselves do not have any noise immunity. Even distorting one bit in the text encrypted with AES, the decryption will result in a completely different text that does not match the original at all. And so I need to find out which noise-correcting coding algorithms are best suited to protect the ciphertext from noise. But there are a lot of error-correcting coding algorithms, so I don’t know which one is better. Which ones can be compared?
Can anyone suggest?

Answer 1

You can start with this https://www.google.com/search?q=code+rida+solomon
And there already in the articles you will find mentions of alternatives.
In the comments, they quite rightly write to you that the choice of the algorithm and its parameters depends on the problem statement: the nature of the interference, how much redundant information we can afford, .. I can describe the
naive algorithm to you in just one phrase:
Transmit the original message 2 * N + 1 times; when received, calculate each bit as a rounded arithmetic mean.
piece of cake :)

Answer 2

Usually start with Hamming codes. They are simple and correct 1 bit per block.
In general, in the encryption stack, recovery codes are not mixed into cipher blocks, but rather wrapped like an envelope.