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 study a class of linear codes defined by characteristicfunctions of certain subsets of a finite field. We derive a sufficient andnecessary condition for such a code to be a minimal linear code by acharacter-theoretical approach. We obtain new three-weight or four-weightminimal linear codes that do not satisfy the Ashikhmin-Barg condition by usingpartial difference sets. We show that our construction yields minimal linearcodes that do not arise from cutting vectorial blocking sets, and also discusstheir applications in secret sharing schemes.

A construction of minimal linear codes from partial difference sets