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

DOI10.1016/J.IC.2006.02.007zbMATH Open1185.68304OpenAlexW2055825231MaRDI QIDQ2373880FDOQ2373880

Authors: Noga Alon, Michael Krivelevich, Dahlia Malkhi, Julien Stern, 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

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

Cites Work

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

Cited In (1)

• Scalable secure storage when half the system is faulty

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

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