Some Combinatorial Aspects of m-Repeated Burst Error Detecting Codes

AbstractThere are several kinds of burst errors for which error detecting and error correcting codes have been constructed. In this paper, we consider a new kind of burst error which will be termed as ‘m-repeated burst error of length b(fixed)’. The paper presents lower bounds on the number of parity-check digits required for a linear code that is capable of detecting errors which are m-repeated burst errors of length b(fixed). Further, codes capable of detecting and simultaneously correcting such errors have also been studied.