Application of coding theory to interconnection networks
From MaRDI portal
Publication:1199457
DOI10.1016/0166-218X(92)90158-7zbMath0757.68018MaRDI QIDQ1199457
Publication date: 16 January 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Network design and communication in computer systems (68M10) Circuits, networks (94C99) Fault detection; testing in circuits and networks (94C12) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Explicit construction of exponential sized families of k-independent sets
- WOM-codes construits à partir des codes de Hamming
- How robust is the n-cube?
- Communication aspects of networks based on geometric incidence relations
- A generalisation to noncommutative groups of a theorem of Mann
- Families of \(k\)-independent sets
- Iterative Exhaustive Pattern Generation for Logic Testing
- Interconnection Networks Based on a Generalization of Cube-Connected Cycles
- Covering radius---Survey and recent results
- A group-theoretic model for symmetric interconnection networks
- Two addition theorems
This page was built for publication: Application of coding theory to interconnection networks