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

In this paper we establish an improved outer bound on thestorage-repair-bandwidth tradeoff of regenerating codes under exact repair. Theresult shows that in particular, it is not possible to construct exact-repairregenerating codes that asymptotically achieve the tradeoff that holds forfunctional repair. While this had been shown earlier by Tian for the specialcase of $[n,k,d]=[4,3,3]$ the present result holds for general $[n,k,d]$. Thenew outer bound is obtained by building on the framework established earlier byShah et al.

An Improved Outer Bound on the Storage-Repair-Bandwidth Tradeoff of Exact-Repair Regenerating Codes