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 with few weights have significant applications in secret sharingschemes, authentication codes, association schemes, and strongly regulargraphs. There are a number of methods to construct linear codes, one of whichis based on functions. Furthermore, two generic constructions of linear codesfrom functions called the first and the second generic constructions, havearoused the research interest of scholars. Recently, in \cite{Nian}, Li andMesnager proposed two open problems: Based on the first and the second genericconstructions, respectively, construct linear codes from non-weakly regularplateaued functions and determine their weight distributions.  Motivated by these two open problems, in this paper, firstly, based on thefirst generic construction, we construct some three-weight and at mostfive-weight linear codes from non-weakly regular plateaued functions anddetermine the weight distributions of the constructed codes. Next, based on thesecond generic construction, we construct some three-weight and at mostfive-weight linear codes from non-weakly regular plateaued functions belongingto $\mathcal{NWRF}$ (defined in this paper) and determine the weightdistributions of the constructed codes. We also give the punctured codes ofthese codes obtained based on the second generic construction and determinetheir weight distributions. Meanwhile, we obtain some optimal and almostoptimal linear codes. Besides, by the Ashikhmin-Barg condition, we have thatthe constructed codes are minimal for almost all cases and obtain some secretsharing schemes with nice access structures based on their dual codes.

Linear codes with few weights from non-weakly regular plateaued functions