Linear convolutional codes for compound channels

A class of linear convolutional codes for compound channels (i.e., channels on which burst and random errors occur) is given. It is shown that for any rate and burst length there exists a linear convolutional code of that rate that can correct almost all bursts of errors of that length and that requires a much smaller guard space than any code that can correct all possible bursts of errors less than or equal to that length. Protection against random errors can be obtained at the expense of the burst-error-correction capability. Explicit formulas are given for the number of bursts and random errors that can be corrected.A particular scheme to construct some codes is given. It is noted that these codes exhibit limited error propagation. A technique for constructing codes that can correct random errors within the guard space is also given