Subspaces in d-bounded distance-regular graphs and authentication code with perfect
点击次数：
论文类型：期刊论文
发表时间：2015-01-01
发表刊物：ARS COMBINATORIA
收录刊物：Scopus、SCIE
卷号：119
页面范围：33-45
ISSN号：0381-7032
关键字：Distance-regular graph; subspaces; d-bounded; authentication code
摘要：Let Gamma be a d-bounded distance-regular graph with diameter d >= 2. In this paper, we give some counting formulas of subspaces in Gamma and construct an authentication code with perfect secrecy.