the paper presents lower and upper bounds on the number of parity check digits required for a linear code that detects solid bursts of length $b$ or less and simultaneously any $e$ or less random errors. an example of such a code is also provided. further, codes capable of detecting and simultaneously correcting such errors have also been dealt with.

There are several kinds of errors for which error detecting and error correcting codes have been constructed. Solid burst errors are common in many communications. In general communication due to the long messages, the strings of solid bursts of small length may repeat in a vector itself. The concept of repeated bursts is introduced by Beraradi, Dass and Verma[3] which has opened a new area of ...

This paper presents a lower and upper bound for linear codes which are capable of correcting errors in the form of solid burst of different lengths within different sub blocks. An illustration of such kind of codes has also been provided.

This paper investigates the performance of the errorforecasting decoding for an interleaved block code on Gilbert–Elliott channels in terms of the word-error probability, which is the sum of the decoder error and failure probabilities. We derive expressions by constructing several Markov chains, starting from a two-state Markov chain of the Gilbert–Elliott channel model. The derived formulas ar...

less, for any burst of length 11 or less induces at most a burst of length 3 or less and one of length 8 or less in the respective classes of digit positions. Some codes obtained along the same lines are listed in Table II, where (b,, bz) and (n, + n,) mean that the code is a combination of a burst-b, code with code-length n, and a burst-b, code with code-length n 2, each of which is generated ...