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

The high repair cost of (n,k) Maximum Distance Separable (MDS) erasure codeshas recently motivated a new class of codes, called Regenerating Codes, thatoptimally trade off storage cost for repair bandwidth. On one end of thisspectrum of Regenerating Codes are Minimum Storage Regenerating (MSR) codesthat can match the minimum storage cost of MDS codes while also significantlyreducing repair bandwidth. In this paper, we describe Exact-MSR codes whichallow for any failed nodes (whether they are systematic or parity nodes) to beregenerated exactly rather than only functionally or information-equivalently.We show that Exact-MSR codes come with no loss of optimality with respect torandom-network-coding based MSR codes (matching the cutset-based lower bound onrepair bandwidth) for the cases of: (a) k/n <= 1/2; and (b) k <= 3. Ourconstructive approach is based on interference alignment techniques, and,unlike the previous class of random-network-coding based approaches, we provideexplicit and deterministic coding schemes that require a finite-field size ofat most 2(n-k).

Exact Regeneration Codes for Distributed Storage Repair Using Interference Alignment