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 consider the repair scheme of Guruswami-Wootters for the Reed-Solomon codeand ask: can we correctly repair a failed node in the presence of erroneousnodes? Equivalently, we consider the collection of downloaded traces as a codeand investigate its code-distance properties. We propose three lower bounds onits minimum distance and study methods to efficiently correct errors close tothese bounds.

Repair of Reed-Solomon Codes in the Presence of Erroneous Nodes