Hits:

Indexed by:期刊论文

Date of Publication:2015-01-01

Journal:ARS COMBINATORIA

Included Journals:SCIE、Scopus

Volume:119

Page Number:33-45

ISSN No.:0381-7032

Key Words:Distance-regular graph; subspaces; d-bounded; authentication code

Abstract: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.