Byzantine fault tolerance of regenerating codes
Recent years have witnessed a slew of coding techniques custom designed for networked storage systems. Network coding inspired regenerating codes are the most prolifically studied among these new age storage centric codes. A lot of effort has been invested in understanding the fundamental achievable...
Saved in:
Main Authors: | Oggier, Frederique, Datta, Anwitaman |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2011
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/93864 http://hdl.handle.net/10220/7074 http://ieeexplore.ieee.org/Xplore/guesthome.jsp |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Self-repairing homomorphic codes for distributed storage systems
by: Oggier, Frederique, et al.
Published: (2011) -
Self-repairing codes for distributed storage : a projective geometric construction
by: Oggier, Frederique, et al.
Published: (2011) -
Byzantine fault-tolerant quorums for atomic read-modify-write operations on erasure coded data
by: Siddharth, Meenachi Sundaram
Published: (2023) -
Fault-tolerant multiprocessor networks
by: Loh, Peter Kok Keong.
Published: (2008) -
Fault-tolerant variable architecture parallel computing platform final report
by: Loh, Peter Kok Keong, et al.
Published: (2008)