... on Codes with Covering Radius 1 and Minimum Distance 2, Des. Codes Cryptogr., 35 (2005), 241-250.[7] Quistorff, J.: On Full Partial Quasigroups of Finite Order and Local Cardinal Maxi-mum Codes, ... 14 (2007), #R51 5code C ⊂ Qn with minimum distance d, and Kq(n, R), the minimal cardinality of a codeC ⊂ Qn with covering radius R, see [2].q-ary codes with covering radius (at most) 1 ... ⊂ R × S × T , both with covering radius 1 and minimum distance 2,respectively. In case of codes of length 2, K(r, s; 2) = min{r, s} is obvious. The presentpaper deals with codes of length 3....