Abstract
A technique for constructing fault-tolerant q-ary k-cube networks for an arbitrary positive integer q is investigated. Extra sets of links are added to construct the fault-tolerant network such that in the presence of link faults, the remaining healthy portion is guaranteed to contain an original fault-free network. Linear codes over an integer ring are used for this approach.
| Original language | English |
|---|---|
| Pages (from-to) | 1025-1026 |
| Number of pages | 2 |
| Journal | Electronics Letters |
| Volume | 33 |
| Issue number | 12 |
| DOIs | |
| State | Published - 05 06 1997 |
| Externally published | Yes |
Keywords
- Codes
- Fault tolerant computing
Fingerprint
Dive into the research topics of 'Constructions of link-fault-tolerant q-ary k-cube networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver