Summary: We consider an upper bound on the minimum length \(n_q(5,d)\) of linear codes with dimension 5 using projective geometry, and we find a new upper bound: \(n_q(5,d)\leq g_q(5,d)+1\) for some values of \(d\).