For the single error correcting convolutional codes introduced by Wyner and Ash, it is shown that if sufficiently few errors occur in an appropriate neighborhood of a block, the probability of correctly decoding that block is independent of errors outside that neighborhood. This fact is used to derive bounds on the bit error probability and the mean time to first error.

IEEE Transactions on Information TheoryMar 1, 19761 citation

The probability of undetected error when a code is used for error correction and detection (Corresp.)

Torleiv Kløve

We study the probability of having an undetected error when a linear block code is used to correct up toterrors on a symmetric channel, and the remaining power of the code is used for error detection.

IEEE Transactions on Information TheoryMar 1, 198410 citations