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

A locally recoverable code (LRC code) is a code over a finite alphabet suchthat every symbol in the encoding is a function of a small number of othersymbols that form a recovering set. Bounds on the rate and distance of suchcodes have been extensively studied in the literature. In this paper we deriveupper bounds on the rate and distance of codes in which every symbol has $t\geq1$ disjoint recovering sets.

Bounds on Locally Recoverable Codes with Multiple Recovering Sets