We prove that any completely regular code with minimum eigenvalue in geometric graph Γ corresponds to a the clique of Γ. Studying interrelation these codes, complete characterization codes Johnson graphs J(n,w) covering radius w−1 and strength 1 is obtained. In particular this result finishes J(n,3). also classify J(n,4) only one case for eigenvalues left open.