reconstructing data on a noisy channel? I have an interesting situation where I have a block cipher and a noisy channel.  The interesting thing is that I happen to know much about the data.  The cipher is a balanced Feistel network, and for the sake of this question, let's just assume that the block size is 32-bits.

What I know: 

The key.
The original data has the format of xx000000, where xx is 8 bits of data.


It then gets encrypted.

The issue is that after encryption, I'm losing 2 bits of the 32-bit stream.  I have plenty of computer power, so I guess that I could just do a comparison because I know that xx will be 0-255 and run some sort of algorithm for flipped bits. 

My question is: does anyone know if someone has looked into this before?  I feel that something like this would be a nice math project.
Use a Hadamard code via the fast Walsh Hadamard transform, it can correct up to $2^{n-2}$ errors for block length $2^n$ and is also locally decidable so you may not need too many code word coordinates.