Bounds on covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring F2+vF2

In this paper, we give some lower and upper bounds on the covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring F2+vF2, where v2=v. We determine the bounds on covering radius of repetition codes, simplex codes and MacDonald codes over this ring.