Repeated restricted Bursts error correcting linear codes Over $G F(q) ; q>2$

Abstract

This paper deals with non binary repeated restricted burst errors. In this paper lower and upper bounds on the number of parity check digits needed for a linear code having the capability to correct the repeated restricted bursts are presented. Restricted bursts are introduced by Tyagi and Lata [11] for non binary case over $G F(3)$. By a restricted burst of length $l$ or less we mean a vector whose all the non zero components are confined to some $l$ consecutive positions, the first and the last of which is nonzero with a restriction that all the non zero consecutive positions contain same field element. For example in non binary case for $q=3, n=3$ and $l=2$, we have the following vectors of length 2 or less $110,220,011,022,100,010,001,200,020,002$.