BURSTS/CT-BURSTS DETECTED BY b-SBEC CODES AND SOLID BURSTS UNDETECTED BY CYCLIC CODES

Abstract

In coding theory, several kinds of errors which depend on the nature of the communication channel are to be dealt with and accordingly codes are constructed to detect and correct such errors. Burst, CT-burst and solid burst errors are common in many communication channels. Different types of linear codes have been developed to deal with such errors. It is also quite possible that in communication more than one type of error occur simultaneously. The code which is developed to deal with one type of error may or may not be able to deal with the other type of error. The paper presents the minimum number of burst/CT-burst errors that will be detected by a b-SBEC code. A lower bound on parity check digits for such code is obtained. Further, the paper presents the number of solid burst errors that will be gone detected/undetected by a cyclic code. By a b-SBEC code, we mean a linear code that corrects all solid bursts of length b or less.