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

Linear codes are the most important family of codes in coding theory. Somecodes have only a few weights and are widely used in many areas, such asauthentication codes, secret sharing schemes, association schemes and stronglyregular graphs. By setting $ p\equiv 1 \pmod 4 $, we construct an infinitefamily of linear codes using two weakly regular unbalanced (and balanced)plateaued functions with index $ \frac{p-1}{2} $. Most of our constructed codeshave a few weights and are minimal. After analysing their punctured version, wefind that they are projective codes containing some optimal ones.

Linear Codes From Two Weakly Regular Plateaued Functions with index (p-1)/2