Generalization of Gallager's adaptive error control scheme
D.D. Sullivan · IEEE Transactions on Information Theory · 1971
One of the simplest, yet most effective schemes thus far devised for the correction of errors on compound channels is the adaptive decoding scheme invented by Gallager. In this paper we present a generalization of this scheme which, at a modest sacrifice in rate, enables the decoder to correct a burst even when the guard space following the burst contains random errors. This is accomplished with the use of two convolutional codes,CandC^ {\ast}, whereC^ {\ast}containsC. At the encoder, the information sequence is first encoded withCand then, after a fixed delay, is encoded with a "shortened" version ofC^ {\ast}, which is added to the parity sequences ofC. At the decoder there are two modes of operation, a random mode and a burst mode. In the random mode errors are corrected withCin a manner similar to that of the Gallager scheme. In the burst mode, the information bits in the bursty blocks are recovered from the later blocks where they have been superimposed on the parity bits. In this mode a decoder forC^ {\ast}, which precedes the decoder forC, removes random errors from these later blocks, thereby greatly increasing the probability of recovery from the burst.