问题
I am doing a software that grabs in the end a numeric string, that string encodes important data, and any error destroy the contents.
Worse: It is VERY prone for errors, because of how data is transmitted (and I can do nothing about it).
So I decided to add a verification digit of sorts... After some research, I have more questions than answers... So, someone can point me to a decent location to study more about that subject?
Also, someone know some popular algorithms that can even fix errors, or at least point where the errors are, so I can retry grabbing the data with error?
Also what I do, if the checksum data itself managed to be wrong in transmission?
回答1:
- Hamming Code
- simple pdf explanation of hamming code
Basically for every N bits of your message, you have some check bits.
You can detect and correct errors in the check bits, based on the data, or errors in the data, based on check bits. Too many errors though, and it's just garbage. There may be a utility in your language of choice to already do this.
回答2:
This can be of use: http://www.eccpage.com/
来源：https://stackoverflow.com/questions/7068398/error-recovery-algorithms