Addendum to ``Scalable secure storage when half the system is faulty [inform. comput. 174 (2)(2002) 203-213]

DOI10.1016/j.ic.2006.02.007zbMath1185.68304OpenAlexW2055825231MaRDI QIDQ2373880

Julien Stern, Michael Krivelevich, Dahlia Malkhi, Noga Alon, Haim Kaplan

Publication date: 16 July 2007

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2006.02.007

Mathematics Subject Classification ID

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) Information storage and retrieval of data (68P20)

Cites Work

• Highly resilient correctors for polynomials
• Tolerating a linear number of faults in networks of bounded degree
• Scalable secure storage when half the system is faulty
• Efficient dispersal of information for security, load balancing, and fault tolerance

This page was built for publication: Addendum to ``Scalable secure storage when half the system is faulty [inform. comput. 174 (2)(2002) 203-213]