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

In this work it is shown that locally repairable codes (LRCs) can belist-decoded efficiently beyond the Johnson radius for a large range ofparameters by utilizing the local error-correction capabilities. Thecorresponding decoding radius is derived and the asymptotic behavior isanalyzed. A general list-decoding algorithm for LRCs that achieves this radiusis proposed along with an explicit realization for LRCs that are subcodes ofReed--Solomon codes (such as, e.g., Tamo--Barg LRCs). Further, a probabilisticalgorithm of low complexity for unique decoding of LRCs is given and itssuccess probability is analyzed.  The second part of this work considers error decoding of LRCs and partialmaximum distance separable (PMDS) codes through interleaved decoding. For aspecific class of LRCs the success probability of interleaved decoding isinvestigated. For PMDS codes, it is shown that there is a wide range ofparameters for which interleaved decoding can increase their decoding radiusbeyond the minimum distance such that the probability of successful decodingapproaches $1$ when the code length goes to infinity.

Error Decoding of Locally Repairable and Partial MDS Codes