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 the 2017 paper by Dougherty, Kim, Ozkaya, Sok, and Sol\'e about the linearprogramming bound for LCD codes the notion $\mathrm{LCD}[n,k]$ was defined forbinary LCD $[n,k]$-codes. We find the formula for $\mathrm{LCD}[n,2]$.

The formula for the largest minimal distance of binary LCD $[n,2]$ codes