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 give an explicit construction of exact cooperative regenerating codes atthe MBCR (minimum bandwidth cooperative regeneration) point. Before the paper,the only known explicit MBCR code is given with parameters $n=d+r$ and $d=k$,while our construction applies to all possible values of $n,k,d,r$. The codehas a brief expression in the polynomial form and the data reconstruction isaccomplished by bivariate polynomial interpolation. It is a scalar code andoperates over a finite field of size $q\geq n$. Besides, we establish severalsubspace properties for linear exact MBCR codes. Based on these properties weprove that linear exact MBCR codes cannot achieve repair-by-transfer.

Exact Cooperative Regenerating Codes with Minimum-Repair-Bandwidth for Distributed Storage