2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/172595For any integer $ρ\geq 1$ and for any prime power q, the explicit construction of a infinite family of completely regular (and completely transitive) q-ary codes with d=3 and with covering radius $ρ$ is given. The intersection array is also computed. Under the same conditions, the explicit construction of an infinite family of q-ary uniformly packed codes (in the wide sense) with covering radius $ρ$, which are not completely regular, is also given. In both constructions the Kronecker product is the basic tool that has been used.Submitted to IT-IEEE. Theorem 1 in Section III was presented at the 2nd International Castle Meeting on Coding Theory and Applications (2ICMCTA), Medina del Campo, Spain, September 2008.}}Information TheoryDiscrete MathematicsCombinatorics94B25text