Hamming Codes, Hypercube Embeddings, and Fault Tolerance

DOI10.1137/S0097539798332464zbMath1144.68008MaRDI QIDQ3507520

William Aiello, Frank Thompson Leighton

Publication date: 19 June 2008

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

hypercubefault toleranceemulationgraph embeddingstree compressiontree embeddingreconfigurationrandom faultsworst-case faults

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (2)

Packing the hypercube ⋮ Fast algorithms for bit-serial routing on a hypercube

This page was built for publication: Hamming Codes, Hypercube Embeddings, and Fault Tolerance