Contents

Ars Combinatoria

  • Research article

Subspaces in \(d\)-Bounded Distance-Regular Graphs and Authentication Codes with Perfect Secrecy

Jizhu Nan1, Jun Guo1,2, Suogang Gao3
1Dept. of Applied Math., Dalian University of Technology, Dalian 116024, China
2 Math. and Inf. College, Langfang Teachers’ College, Langfang 065000, China
3Math. and Inf. College, Hebei Normal University, Shijiazhuang 050016, China
  • Published: 31/01/2015

Abstract

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

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Jizhu Nan, Jun Guo, Suogang Gao. Subspaces in \(d\)-Bounded Distance-Regular Graphs and Authentication Codes with Perfect Secrecy[J], Ars Combinatoria, Volume 119. 33-45. .