Summary: Many kinds of errors in coding theory have been dealt with for which codes have been constructed to combat such errors. Though there is a long history concerning the growth of the subject and many of the codes developed have found applications in numerous areas of practical interest, one of the areas of practical importance in which a parallel growth of the subject took place is that of burst error detecting and correcting codes. The nature of burst errors differ from channel to channel depending upon the behaviour of channels or the kind of errors which occur during the process of data transmission. In very busy communication channels, errors repeat themselves more frequently. In view of this, it is desirable to consider repeated burst errors. The paper presents lower and upper bounds on the number of parity-check digits required for a linear code correcting errors in the form of repeated bursts. An upper bound for a code that detects m-repeated bursts has also been derived. Illustrations of several codes that correct 2-repeated bursts of different lengths have also been given.