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

An interpolation-based decoding scheme for interleaved subspace codes ispresented. The scheme can be used as a (not necessarily polynomial-time) listdecoder as well as a probabilistic unique decoder. Both interpretations allowto decode interleaved subspace codes beyond half the minimum subspace distance.Further, an efficient interpolation procedure for the required linearizedmultivariate polynomials is presented and a computationally- andmemory-efficient root-finding algorithm for the probabilistic unique decoder isproposed. These two efficient algorithms can also be applied for acceleratingthe decoding of interleaved Gabidulin codes.

Efficient Interpolation-Based Decoding of Interleaved Subspace and Gabidulin Codes