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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

This paper presents an explicit construction for an$((n=2qt,k=2q(t-1),d=n-(q+1)), (\alpha = q(2q)^{t-1},\beta =\frac{\alpha}{q}))$ regenerating code (RGC) over a field $\mathbb{F}_Q$ havingrate $\geq \frac{t-2}{t}$. The RGC code can be constructed to have rate $k/n$as close to $1$ as desired, sub-packetization level $\alpha \leqr^{\frac{n}{r}}$ for $r=(n-k)$, field size $Q$ no larger than $n$ and where allcode symbols can be repaired with the same minimum data download.

An Explicit, Coupled-Layer Construction of a High-Rate Regenerating Code with Low Sub-Packetization Level, Small Field Size and $d< (n-1)$