Codes Detecting and Correcting Solid Burst Errors

The main tasks in coding theory are to find codes which detect and correct errors. The bounds are important in terms of error-detecting and -correcting capabilities of the codes. Solid Burst errors are the type of errors that occur in several communication channels. This paper obtains lower and upper bounds on the number of parity-check digits required for linear codes capable of detecting and correcting such errors. Illustrations of codes for detecting as well as correcting such errors are provided