Subspaces in d-bounded distance-regular graphs and authemtication code with perfect secrecy.
Jizhu NanJun GuoSuogang GaoPublished in: Ars Comb. (2015)
Keyphrases
- graph matching
- source code
- distance measure
- euclidean distance
- graph theory
- bounded treewidth
- spread spectrum
- graph partitioning
- graph mining
- data sets
- distance function
- low dimensional
- high dimensional data
- subspace clustering
- hamming distance
- security analysis
- minimum distance
- neighborhood graph
- high dimensional
- similarity measure