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

Codes in the Grassmannian have recently found an application in randomnetwork coding. All the codewords in such codes are subspaces of $\F_q^n$ witha given dimension.  In this paper, we consider the problem of list decoding of a certain familyof codes in the Grassmannian, called lifted Gabidulin codes.  For this purpose we use the Pl\"ucker embedding of the Grassmannian. Wedescribe a way of representing a subset of the Pl\"ucker coordinates of liftedGabidulin codes as linear block codes. The union of the parity-check equationsof these block codes and the equations which arise from the description of aball around a subspace in the Pl\"ucker coordinates describe the list ofcodewords with distance less than a given parameter from the received word.

List Decoding of Lifted Gabidulin Codes via the Pl\"ucker Embedding