Extending work of M. Zarzar, we evaluate the potential of Goppa-type evaluation codes constructed from linear systems on projective algebraic surfaces with small Picard number. Putting this condition on the Picard number provides some control over the numbers of irreducible components of curves on the surface and hence over the minimum distance of the codes. We find that such surfaces do not automatically produce good codes; the sectional genus of the surface also has a major influence. Using that additional invariant, we derive bounds on the minimum distance under the assumption that the hyperplane section class generates the Neron-Severi group. We also give several examples of codes from such surfaces with minimum distance better than the best known bounds in Grassls tables.