New bounds for linear codes of covering radius 2

The length function q(r,R) is the smallest length of a q-ary linear code of covering radius R and codimension r. New upper bounds on q(r, 2) are obtained for odd r ≥ 3. In particular, using the one-to-one correspondence between linear codes of covering radius 2 and saturating sets in the projective planes over finite fields, we prove that q(3, 2) ≤ q(3 ln q + ln ln q) + q 3 ln q + 3 and then obtain estimations of q(r, 2) for all odd r ≥ 5. The new upper bounds are smaller than the previously known ones. Also, the new bounds hold for all q, not necessary large, whereas the previously best known estimations are proved only for q large enough.