A CLASS OF CAYLEY GRAPH INTERCONNECTION NETWORKS BASED ON ROSENBLOOM-TSFASMAN METRIC

Rosenbloom and Tsfasman introduced a new metric (RT metric) which is a generalization of the Hamming metric. In this paper we propose a Cayley interconnection network based on the RT metric. We also introduce a new family of Cayley graphs on symmetric groups with respect to the RT metric. We also describe various algebraic and topological properties of these networks and propose optimal routing algorithm.