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

A sum-rank-metric code attaining the Singleton bound is called maximumsum-rank distance (MSRD). MSRD codes have been constructed for some parametercases. In this paper we construct a linear MSRD code over an arbitrary field${\bf F}_q$ with various matrix sizes $n_1>n_2>\cdots>n_t$ satisfying $n_i \geqn_{i+1}^2+\cdots+n_t^2$ for $i=1, 2, \ldots, t-1$ for any given minimumsum-rank distance.

Linear MSRD codes with Various Matrix Sizes and Unrestricted Lengths