Application of coding theory to interconnection networks

Application of coding theory to interconnection networks

0.00 Avg rating0 Votes
Article ID: iaor1993680
Country: Netherlands
Volume: 37/38
Issue: 1/5
Start Page Number: 553
End Page Number: 562
Publication Date: Jul 1992
Journal: Discrete Applied Mathematics
Authors: ,
Abstract:

The authors give a few examples of applications of techniques and results borrowed from error-correcting codes to problems in graphs and interconnection networks. The degree and diameter of Cayley graphs with vertex set (Z/2Z)r are investigated. The asymptotic case is dealt with in Section 2. The robustness, or fault tolerance, of the n-cube interconnection network is studied in Section 3.

Reviews

Required fields are marked *. Your email address will not be published.