At first I thought about using checksums, but obviously I might miss bit errors greater than one bit. Parity does not Works, so CRC may be the best choice.
Is the use of cyclic redundancy checking effective in kilobytes? Or are there other ways to work better?
There are different designs to generate CRC polynomials, where the trade-off is accuracy and computational complexity. In your case, you can choose to match your The “fastest” accuracy requirement.
You may want to start with this Wikipedia article on Cyclic Redundancy Check.
Me There is a hypothetical case of sending data units, each data unit has a thousand bytes. The failure rate is very small, but when an error occurs, it is unlikely to be a single bit error, and more likely to be in several consecutive bits Error.
At first I thought about using a checksum, but obviously I might miss bit errors larger than one bit. Parity check also doesn’t work, so CRC may be the best choice.
/p>
Is cyclic redundancy check valid kilobytes? Or are there other ways to work better?
Cyclic Redundancy Checks (CRC) are particularly popular because they can detect multiple bit error rates with guaranteed accuracy.
There are different designs to generate CRC polynomials, where the trade-off is accuracy and computational complexity. In your case, you can choose the “fastest” that meets your accuracy requirements.
p>
You may want to start with this Wikipedia article on Cyclic Redundancy Check.