English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We present the construction of a family of erasure correcting codes fordistributed storage that achieve low repair bandwidth and complexity at theexpense of a lower fault tolerance. The construction is based on two classes ofcodes, where the primary goal of the first class of codes is to provide faulttolerance, while the second class aims at reducing the repair bandwidth andrepair complexity. The repair procedure is a two- step procedure where parts ofthe failed node are repaired in the first step using the first code. Thedownloaded symbols during the first step are cached in the memory and used torepair the remaining erased data symbols at minimal additional read cost duringthe second step. The first class of codes is based on MDS codes modified usingpiggybacks, while the second class is designed to reduce the number ofadditional symbols that need to be downloaded to repair the remaining erasedsymbols. We numerically show that the proposed codes achieve better repairbandwidth compared to MDS codes, codes constructed using piggybacks, and localreconstruction/Pyramid codes, while a better repair complexity is achieved whencompared to MDS, Zigzag, Pyramid codes, and codes constructed using piggybacks.

Code Constructions for Distributed Storage With Low Repair Bandwidth and Low Repair Complexity