linear codes on solid bursts and random errors

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.