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

In this paper, we generalize the method of using two parallel versions of thelifted MRD code from the existing work [1]. The Delsarte theorem of the rankdistribution of MRD codes is an important part to count codewords in ourconstruction. We give a new generalize construction to the following bounds: ifn>=k>=d, then $Aq(n +k,k,d)>=q^{n(k-\frac{d}{2}+1)}+\sum_{r=\frac{d}{2}}^{k-\frac{d}{2}}A_r(Q_q(n,k,\frac{d}{2})).$ On this basis, we also give a construction ofconstant-dimension subspace codes from several parallel versions of lifted MRDcodes. This construction contributes to a new lower bounds forAq((s+1)k+n,d,k).

Construction of Const Dimension Codes from Serval Parallel Lift MRD Code