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.
J. Arlat and W. C. Carter (1984). Implementation and Evaluation of a (b,k)-Adjacent Error-Correcting/Detecting Scheme for Supercomputer Systems. IBM J. Res. Develop.. 28 (2), 159-169
G. E. Sacks (1958). Multiple error correction by means of parity-checks. IRE Trans.. IT-4, 145-147
S. H. Reiger (1960). Codes for the correction of clustered errors. Trans. IRE. IT-6, 16-21
A. G. Schillinger (1964). A class of solid burst error correcting codes. Polytechnic Institute of Brooklyn, N. Y., Research Rept. PIBMRI.