An Efficient Parity Checking Scheme for Random and Burst Errors
B. Murthy · IRE Transactions on Communications Systems · 1976
In this concise paper we describe an efficient scheme for random and burst error checking by a combination of serial parity checking and convolutional interleaving. The framing for interleaved blocks is shown possible by a simple implementation, and the error detection capability is better than other schemes similar in complexity. The proposed scheme has useful applications for digital transmission.