Subspaces in $d$-Bounded Distance-Regular Graphs and Authentication Codes with Perfect Secrecy

Abstract

Let $\mathrm{\Gamma }$ be a $d$-bounded distance-regular graph with diameter $d\ge 2$.In this paper, we give some counting formulas of subspaces in $\mathrm{\Gamma }$ and construct an authentication code with perfect. secrecy.