Codes correcting and simultaneously detecting solid burst errors

Abstract

Detecting and correcting errors is one of the main tasks in coding theory. The bounds are important in terms of error-detecting and -correcting capabilities of the codes. Solid Burst error is common in several communication channels. This paper obtains lower and upper bounds on the number of parity-check digits required for linear codes capable of correcting any solid burst error of length b or less and simultaneously detecting any solid burst error of length s(>b) or less. Illustration of such a code is also provided.

Keywords: Parity check matrix, Syndromes, Solid burst errors, Standard array

DOI: 10.18495/comengapp.21.143150