Fast broadcasting and gathering in q-ary cubes using error-correction codes

被引：1

作者：

Latifi, S ^{[1
]}

机构：

[1] Univ Nevada, Dept Elect & Comp Engn, Las Vegas, NV 89154 USA

来源：

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 1998年 / 48卷 / 01期

基金：

美国国家科学基金会;

关键词：

broadcasting; codes; gathering; perfect codes; quasi-perfect codes;

D O I：

10.1006/jpdc.1997.1399

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

An interesting application of coding theory in network routing is presented. Certain error-correcting codes can be employed to specify a minimal subset of nodes called "stations" which are at distance t from the rest of the nodes. The stations, acting as relay agents, can then broadcast data/control information from a central controller to all the nodes (or conversely from the nodes to the central controller) in no more than t steps. The network considered is the q-ary n-dimensional hypercube. The study shows that for a given t, perfect codes yield the minimal set of stations whereas quasi-perfect codes render suboptimal solutions. (C) 1998 Academic Press.

引用

页码：52 / 63

页数：12