This paper presents a lower and an upper bound on the number of parity check digits required for a linear code that corrects a single sub-block containing errors which are in the form of 2-repeated bursts of length b or less. An illustration of such kind of codes has been provided. Further, the codes that correct m-repeated bursts of length b or less have also been studied
