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

被引:0
|
作者
Vasantha, W. B. [1 ]
Rajkumar, R. [1 ]
机构
[1] Indian Inst Technol, Dept Math, Madras 600036, Tamil Nadu, India
关键词
Interconnection networks; Cayley graphs; Rosenbloom-Tsfasman metric; Symmetric groups; Optimal routing; CODES;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:66 / 72
页数:7
相关论文
共 50 条