For $q,n,d \in \mathbb{N}$, let $A_q(n,d)$ be the maximum size of a code $C \subseteq [q]^n$ with minimum distance at least $d$. We give a divisibility argument resulting in the new upper bounds $A_5(8,6) \leq 65$, $A_4(11,8)\leq 60$ and $A_3(16,11) \leq 29$. These in turn imply the new upper bounds $A_5(9,6) \leq 325$, $A_5(10,6) \leq 1625$, $A_5(11,6) \leq 8125$ and $A_4(12,8) \leq 240$. Furthermore, we prove that for $μ,q \in \mathbb{N}$, there is a 1-1-correspondence between symmetric $(μ,q)$-nets (which are certain designs) and codes $C \subseteq [q]^{μq}$ of size $μq^2$ with minimum distance at least $μq - μ$. We derive the new upper bounds $A_4(9,6) \leq 120$ and $A_4(10,6) \leq 480$ from these `symmetric net' codes.