Fault-tolerant cube graphs and coding theory

DOI10.1109/18.556609MaRDI QIDQ4336403zbMATH OpenOpenAlexFDO

Authors Jehoshua Bruck, Ching-Tien Ho

Publication date 12 May 1997

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://authors.library.caltech.edu/5704/

zbMATH Keywords

parallel computingfault tolerancehypercubeserror-correcting codesOmega networks

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Recommendations

• Fault tolerance of Cayley graphs
• Cayley graphs with optimal fault tolerance
• Fault tolerance in k-ary n-cube networks
• Conditional fault tolerance in a class of Cayley graphs
• Graph theoretic error-correcting codes
• Hamming Codes, Hypercube Embeddings, and Fault Tolerance
• Structure fault tolerance of \(k\)-ary \(n\)-cube networks
• Graph theoretic methods in coding theory
• Fault-tolerant cycles embedding in hypercubes with faulty edges
• Error-correcting codes from graphs

Cited in

(4)

• Hamming Codes, Hypercube Embeddings, and Fault Tolerance
• Application of coding theory to interconnection networks
• Design of gracefully degradable hypercube-connected systems
• Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes

This page was built for publication: Fault-tolerant cube graphs and coding theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336403)