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

Gabidulin codes can be seen as the rank-metric equivalent of Reed-Solomoncodes. It was recently proven, using subspace polynomials, that Gabidulin codescannot be list decoded beyond the so-called Johnson radius. In another result,cyclic subspace codes were constructed by inspecting the connection betweensubspaces and their subspace polynomials. In this paper, these subspace codesare used to prove two bounds on the list size in decoding certain Gabidulincodes. The first bound is an existential one, showing that exponentially-sizedlists exist for codes with specific parameters. The second bound presentsexponentially-sized lists explicitly, for a different set of parameters. Bothbounds rule out the possibility of efficiently list decoding several familiesof Gabidulin codes for any radius beyond half the minimum distance. Such aresult was known so far only for non-linear rank-metric codes, and not forGabidulin codes. Using a standard operation called lifting, identical resultsalso follow for an important class of constant dimension subspace codes.

Some Gabidulin Codes cannot be List Decoded Efficiently at any Radius