Two kinds of Cartesian codes are constructed by using a distance-regular graph of order (s,t) and antipodal distance-regular graphs of diameter d, respectively. Moreover, their parameters and the probability of successful impersonation attack and substitution attack are computed, respectively.