|
In data transimission and data storage, it is usually desirable to
Provide a simple scheme for ewor detection. A parity check or a sum
check is often used for such purposes. Although to probability of
detecting parity violations is known, a closed-form expression for
the probability of detecting Checksum Violations does not seem to have
been obtained before. This paper derives such an expression. Section
Ⅱ presents the closed-form expressions. They are verified by an
independent method in Section Ⅲ, Section Ⅳ discusses the results
obtained. The detailed derivations are given in the Appendices.
|