Linear Codes Constructed From Two Weakly Regular Plateaued Functions with Index 11footnotemark: 1
Abstract
Linear codes are the most important family of codes in cryptography and coding theory. Some codes have only a few weights and are widely used in many areas, such as authentication codes, secret sharing schemes and strongly regular graphs. By setting , we construct an infinite family of linear codes using two distinct weakly regular unbalanced (and balanced) plateaued functions with index . Their weight distributions are completely determined by applying exponential sums and Walsh transform. As a result, most of our constructed codes have a few nonzero weights and are minimal.
keywords:
linear code , plateaued function , the weight distribution , Walsh transform.MSC:
[2010] 94B15 , 11T714.∎
| weight | frequency |
| weight | frequency |
| weight | frequency |
| weight | frequency |
| for all |
Theorem 2.
Supposethatf,g∈WRPwithlg=p-12.Lets+tbeeven.Iflf=p-12,thenCDf,gisathree-weight[n,2m]linearcodewithitsweightdistributionlistedinTableLABEL:evenc1.Iflf=p-1,thenCDf,gisafour-weight[n,2m]linearcodewithitsweightdistributionlistedinTableLABEL:evenc2.Otherwiseiflf=2,thenCDf,gisafour-weight[n,2m]linearcodewithitsweightdistributionlistedinTableLABEL:evenc3whenp≡1(mod8),andinTableLABEL:evenc4whenp≡5(mod8).Herewesetn=p2m-1-1+(p-1)εfεgpτ-2forbrevity.
Proof.
ThelengthofthecodeCDf,gcomesfromLemmaLABEL:lem:length.For(a,b)∈Fq2\{(0,0)},theweightwt(c(a,b))=n+1-N0canbeobtainedfromLemmaLABEL:lem:N0_even.Tobemoreexplicit,when(a,b)∉Sf×Sg,wehavewt(c(a,b))=(p-1)(p2m-2+(p-1)εfεgpτ-4).ByLemmaLABEL:lem:car,thefrequencyofsuchcodewordsequalsp2m-pγsincef,g∈WRP.When(a,b)∈Sf×Sg\{(0,0)},wewilldiscussthefollowingfourdifferentcases.
LABEL:lem:Tforc≠0.ThisgivestheweightdistributioninTableLABEL:evenc1.
LABEL:evenc2.
LABEL:evenc3.