摘要：In coding theory the importance of burst error correcting and detecting codes is well known. In general communication the messages are long and the strings of bursts may be short, repeating in a vector itself. The idea of repeated bursts, introduced by Beraradi, Dass and Verma has opened this area of study. They defined 2-repeated bursts and obtained results for detection and correction of such type of errors. Later on, Dass and Verma generalized this idea and defined m-repeated bursts. They also obtained results regarding the correction and detection of m-repeated bursts. In this paper we obtain results on weights of all vectors having m-repeated bursts of the same size. Another section is devoted to the study of vectors having m-repeated bursts with weight constraints. This study can help developing more efficient codes with these vectors as error patterns.
关键词：m-repeated bursts; efficient codes; weights of vectors.
