Outer bounds on the storage-repair bandwidth trade-off of exact-repair regenerating codes
In this paper, three outer bounds on the normalised storage-repair bandwidth trade-off of regenerating codes having parameter set {n, k, d, α, β} under the exact-repair ER setting are presented. The first outer bound, termed as the repair-...
Cooperative repair of multiple node failures in distributed storage systems
Cooperative regenerating codes are designed for repairing multiple node failures in distributed storage systems. In contrast to the original repair model of regenerating codes, which are for the repair of single node failure, data exchange among the new ...
Integrated interleaved codes as locally recoverable codes: properties and performance
Considerable interest has been paid in recent literature to codes combining local and global properties for erasure correction. Applications are in cloud type of implementations, in which fast recovery of a failed storage device is important, but ...
Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
We consider linear cyclic codes with the locality property or locally recoverable codes LRC codes. A family of LRC codes that generalises the classical construction of Reed-Solomon codes was constructed in a recent paper by Tamo and Barg IEEE ...
Updatable encryption in distributed storage systems using key-homomorphic pseudorandom functions
Distributed storage systems DSSs store linear combinations of data across different nodes such that, data lost due to node failures can be restored from surviving nodes. We address key rotation in DSSs: assume that a user wants to remotely change the ...