Extremal 1-codes in distance-regular graphs of diameter 3.

Aleksandar Jurisic Janos Vidali

Published in: Des. Codes Cryptogr. (2012)

Keyphrases

graph theory
maximum distance
distance measure
error correction
complex networks
graph theoretic
distance function
euclidean distance
graph matching
code length
data sets
distance matrix
graph representation
graph partitioning
graph databases
directed graph
dimensionality reduction
nearest neighbor