Two kinds of authentication codes associated with distance-regular graphs
Zengti Li · Hebei ke-ji daxue xuebao · 2012
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.