Next Article in Journal
The Interplay between Tunneling and Parity Violation in Chiral Molecules
Previous Article in Journal
Systems and Methods for Transformation and Degradation Analysis
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Linear Codes Constructed from Two Weakly Regular Plateaued Functions with Index (p − 1)/2

1
School of Mathematical Sciences, Qufu Normal University, Jining 273165, China
2
School of Mathematics and Statistics, Fujian Normal University, Fuzhou 350117, China
3
School of Mathematics, Sun Yat-sen University, Guangzhou 510275, China
*
Author to whom correspondence should be addressed.
Entropy 2024, 26(6), 455; https://doi.org/10.3390/e26060455
Submission received: 14 April 2024 / Revised: 17 May 2024 / Accepted: 23 May 2024 / Published: 27 May 2024
(This article belongs to the Section Information Theory, Probability and Statistics)

Abstract

:
Linear codes are the most important family of codes in cryptography and coding theory. Some codes only have a few weights and are widely used in many areas, such as authentication codes, secret sharing schemes and strongly regular graphs. By setting p 1 ( mod 4 ) , we constructed an infinite family of linear codes using two distinct weakly regular unbalanced (and balanced) plateaued functions with index ( p 1 ) / 2 . Their weight distributions were 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.

1. Introduction

Let p be a prime number and F p the finite field with p elements. We denote C to be a linear code over F p with parameters [ n , k , d ] , which that means C is a subspace of dimension k with minimum distance d of the vector space F p n . Compared with nonlinear codes, linear codes are easier to describe, encode and decode, due to their algebraic structure, so they have many applications in cryptography and communications. See [1] for more information about linear codes.
For a codeword c = ( c 0 , c 1 , , c n 1 ) C , its weight is defined by
wt ( c ) = # { 0 i < n : c i 0 } .
Then, the weight distribution of C is the sequence A 0 , A 1 , A 2 , , A n , where A 0 = 1 and A w stands for the number of codewords in C that have weight w, for 0 w n , i.e.,
A w = # { c C : wt ( c ) = w } .
The code C is called t-weight if the number of nonzero A w for 1 w n equals t. Linear codes with a few nonzero weights have attracted much attention in recent decades due to their wide applications in theory and practice, see [2,3,4,5,6,7,8,9,10,11]. Some linear codes are constructed from bent functions [6,12], square functions [13] and weakly regular plateaued functions [3,5,7].
In what follows, we always assume p is an odd prime. Now, let us introduce an efficient way to construct linear codes, which was proposed by Ding et al. [14]. Let q = p m and D be a subset of F q of size n. We define
C D = c ( a ) = Tr ( a x ) x D : a F q ,
where Tr is the absolute trace function. It can be checked that C D is a linear code of length n. The set D is called the defining set of C D . This approach was generalized by Li et al. [15], who defined a class of codes by
C D = c ( a , b ) = Tr ( a x + b y ) ( x , y ) D : a , b F q ,
where the defining set D is a subset of F q 2 . Let c F p . For p-ary functions f and g, we define
D ( c ) = ( x , y ) F q 2 { ( 0 , 0 ) } : f ( x ) + g ( y ) = c .
Based on [15], Wu et al. [16] offered new linear codes using the defining set D ( 0 ) , where f and g are weakly regular bent functions from F q to F p . Later, Cheng et al. in [3] introduced several linear codes C D ( 0 ) of (1) with a few weights by considering f and g to be weakly regular unbalanced s-plateaued functions in the defining set D ( 0 ) , where 0 s m . In 2022, Sınak [17] went deeper by choosing the weakly regular unbalanced and balanced s f -plateaued function f and s g -plateaued function g in D ( 0 ) , where 0 s f , s g m . Very recently, Yang et al. [18] continued the research of [17] by considering two weakly regular balanced plateaued functions in the defining set D ( c ) , where c 0 . All of them studied the indexes of f and g among the set { 2 , p 1 } , that is, l f , l g { 2 , p 1 } .
Along this research line, we further consider the index of ( p 1 ) / 2 , where p 1 ( mod 4 ) . Let f and g be certain weakly regular unbalanced and balanced s-plateaued and t-plateaued functions, respectively, for 0 s , t m . The defining set is denoted by
D f , g = ( x , y ) F q 2 { ( 0 , 0 ) } : f ( x ) + g ( y ) = 0 .
For clarity, we only concentrate on the case of l g = ( p 1 ) / 2 and l f { 2 , p 1 } , since the case of l f = ( p 1 ) / 2 and l g { 2 , p 1 } will lead to similar results (also, see Remark 3 for the case of l f = l g = ( p 1 ) / 2 ). In this paper, we consider the constructed codes C D f , g of (1) and (2). In detail, we will completely determine their weight distributions using the theory of exponential sums and Walsh transform.
The rest of this paper is arranged as follows. We first present, in Section 2, an introduction to the mathematical foundations. Section 3 gives necessary results for our computation. Our main results are proposed in Section 4, where we study the weight distributions and the parameters of our constructed codes and their punctured ones. Section 5 shows the minimality and applications of these codes. Finally, the whole paper is concluded in Section 6.

2. Mathematical Background

In this section, let us have a quick glance at the mathematical background, including cyclotomic classes, cyclotomic fields, the theory of exponential sums and weakly regular plateaued functions. We recall that q = p m and m 2 . We denote by S q (resp. N s q ) the set of square (resp. non-square) elements in F p * .

2.1. Cyclotomic Classes and Cyclotomic Fields

Let θ be a fixed primitive element of F q and N 2 be a divisor of q 1 . For 0 i < N , the i-th cyclotomic classes of order N are defined by C i ( N , q ) = θ i θ N , where θ N stands for the subgroup generated by θ N .
The p-th cyclotomic field is denoted by K = Q ( ζ p ) , where ζ p = exp 2 π 1 p . From [19], we know that the Galois group Gal ( K / Q ) is given by { σ z : z F p * } , where the automorphism σ z of K is defined by σ z ( ζ p ) = ζ p z . Let η be the quadratic character of F p . Then, σ z ( p * ) = η ( z ) p * , where p * = η ( 1 ) p .

2.2. Exponential Sums

We denote by η m the quadratic character of F q , where q = p m . Let G ( η m ) be the quadratic Gauss sum over F q defined by
G ( η m ) = x F q * η m ( x ) χ 1 ( x ) ,
where χ 1 ( x ) = ζ p Tr ( x ) is the canonical additive character, and Tr is the absolute trace function. It is well known that G ( η m ) = ( 1 ) m 1 p * m and G ( η ) = p * .
For n N and a F q * , the Jacobsthal sum is defined by
H n ( a ) = x F q η m ( x n + 1 + a x ) = x F q η m ( x ) η m ( x n + a ) .
We define
I n ( a ) = x F q η m ( x n + a ) .
It is a companion sum related to Jacobsthal sums because I 2 n ( a ) = I n ( a ) + H n ( a ) , which is due to Theorem 5.50 in [20]. We can evaluate easily that I 1 ( a ) = 0 and I 2 ( a ) = 1 for all a F q * . In general, the sums I n ( a ) can be described in terms of Jacobi sums.
Lemma 1
(Theorem 5.51, [20]). For all a F q * and n N , we have
I n ( a ) = η m ( a ) j = 1 d 1 λ j ( a ) J ( λ j , η m ) ,
where λ is a multiplicative character of F q of order d = gcd ( n , q 1 ) , and J ( λ j , η m ) is a Jacobi sum in F q .
Lemma 2
(Theorem 5.33, [20]). Let q = p m be odd and f ( x ) = a 2 x 2 + a 1 x + a 0 F q [ x ] with a 2 0 . Then,
x F q ζ p Tr ( f ( x ) ) = ζ p Tr ( a 0 a 1 2 ( 4 a 2 ) 1 ) η m ( a 2 ) G ( η m ) .

2.3. Weakly Regular Plateaued Functions

Let f : F q F p be a p-ary function. For β F q , the Walsh transform of f is defined by
χ ^ f ( β ) = x F q ζ p f ( x ) Tr ( β x ) .
A function f is said to be balanced if χ ^ f ( 0 ) = 0 ; otherwise, it is said to be unbalanced.
Plateaued functions in characteristic 2 were first studied by Zheng et al. [21] for cryptographic applications in 1999, and later in any general characteristic p by Mesnager [22] in 2014. Several years ago, Mesnager et al. presented the definition of (non-)weakly regular plateaued functions in their work [23]. We follow the notation used in [23]. A function f is s-plateaued if | χ ^ f ( β ) | 2 { 0 , p m + s } for each β F q , where 0 s m . Let S f be the Walsh support of f. In fact,
S f = { β F q : | χ ^ f ( β ) | 2 = p m + s } .
According to [22], the cardinality of S f is given by # S f = p m s .
Definition 1
([23]). A function f is called weakly regular s-plateaued if there exists a complex number u, | u | = 1 , such that
χ ^ f ( β ) { 0 , u p m + s 2 ζ p g ( β ) }
for all β F q , where g is a p-ary function over F q satisfying g ( β ) = 0 for all β F q S f . Otherwise, if u depends on β, then f is called non-weakly regular s-plateaued.
Lemma 3
(Lemma 5, [23]). Let β F q and f a weakly regular s-plateaued function. For every β S f , we have
χ ^ f ( β ) = ε f p * m + s ζ p f ( β ) ,
where ε f { ± 1 } is the sign of χ ^ f and f is a p-ary function over F q with f ( β ) = 0 for all β F q S f . We call f the dual function of f.
In 2020, Mesnager and Sınak [5,7] defined two subclasses of weakly regular plateaued functions.
Definition 2
([5,7]). Let f be a weakly regular unbalanced (resp. balanced) s-plateaued function with 0 s m . We denote by WRP (resp. WRPB) the subclass of the unbalanced (resp. balanced) functions f that meet the following homogeneous conditions simultaneously:
1. 
f ( 0 ) = 0 ;
2. 
There exists a positive integer h f , such that 2 h f , gcd ( h f 1 , p 1 ) = 1 and f ( z x ) = z h f f ( x ) for every z F p * .
Remark 1.
It is clear that 0 S f (resp. 0 S f ) whenever f WRP (resp. f WRPB ).
The following lemmas, due to [5,17], play a significant role in the following calculation.
Lemma 4
(Lemma 6, [5]). Let f WRP or f WRPB with χ ^ f ( β ) = ε f p * m + s ζ p f ( β ) , where β S f . Then, for z F p * , we have z β S f if β S f , and otherwise, we have z β F q S f .
Lemma 5
(Propositions 2 and 3, [5]). Let f WRP or f WRPB with χ ^ f ( β ) = ε f p * m + s ζ p f ( β ) , where β S f . Then, f ( 0 ) = 0 and f ( z β ) = z l f f ( β ) for all z F p * , where 2 l f and gcd ( l f 1 , p 1 ) = 1 . We call l f the index of f.
Remark 2.
According to Lemma 5, if we take l f = ( p 1 ) / 2 , then we must have p 1 ( mod 4 ) .
Lemma 6
(Lemma 10, [5]). Let f WRP or f WRPB with χ ^ f ( β ) = ε f p * m + s ζ p f ( β ) , where β S f . For c F p , we define
N f ( c ) = # { β S f : f ( β ) = c } .
When 2 m s ,
N f ( c ) = p m s 1 + ( p 1 ) η m + 1 ( 1 ) ε f p * m s 2 , if   c = 0 , p m s 1 η m + 1 ( 1 ) ε f p * m s 2 , if   c 0 .
Otherwise,
N f ( c ) = p m s 1 , if   c = 0 , p m s 1 + η ( c ) η m ( 1 ) ε f p * m s 1 , if   c 0 .
Lemma 7
(Lemma 3.12, [17]). Let f , g WRP or f , g WRPB with χ ^ f ( α ) = ε f p * m + s ζ p f ( α ) and χ ^ g ( β ) = ε g p * m + t ζ p g ( β ) , where α S f and β S g . We define
T ( 0 ) = # { ( a , b ) S f × S g : f ( a ) + g ( b ) = 0 } , T ( c ) = # { ( a , b ) S f × S g : f ( a ) + g ( b ) = c } for   c F p * .
Then, we have
T ( 0 ) = p 2 m s t 1 + ( p 1 ) p 1 ε f ε g p * 2 m s t , if 2 s + t , p 2 m s t 1 , if 2 s + t , T ( c ) = p 2 m s t 1 p 1 ε f ε g p * 2 m s t , if 2 s + t , p 2 m s t 1 + η ( c ) ε f ε g p * 2 m s t 1 , if 2 s + t .
Lemma 8
(Lemma 3.7, [17]). We write n = # D f , g , where D f , g is defined by (2) and f , g are given in Lemma 7. If f , g WRPB , then n = p 2 m 1 1 . If f , g WRP , then
n = p 2 m 1 1 , if 2 s + t , p 2 m 1 1 + ( p 1 ) p 1 ε f ε g p * 2 m + s + t , if 2 s + t .

3. Auxiliary Results

To ensure that the frequency of each weight appears in our codes, we will need the following lemmas.
Lemma 9.
Let p 1 ( mod 2 ) . For the quadratic character η over F p , we have
u S q v S q v ± u η ( u + v ) = p 1 2 ( η ( 2 ) + 1 ) , u N s q v N s q v ± u η ( u + v ) = p 1 2 ( η ( 2 ) + 1 ) .
Proof. 
We note that 1 S q if p 1 ( mod 4 ) , and otherwise, 1 N s q if p 3 ( mod 4 ) . Thus,
u S q v S q v ± u η ( u + v ) = u S q η ( u ) v S q v ± u η ( 1 + v u ) = u S q v S q v ± 1 η ( 1 + v ) = p 1 2 v S q η ( 1 + v ) η ( 2 ) = p 1 2 1 2 x F p η ( 1 + x 2 ) 1 2 η ( 2 ) = p 1 2 1 2 I 2 ( 1 ) 1 2 η ( 2 ) .
The first assertion then follows from I 2 ( 1 ) = 1 . The second one is analogously proved and is omitted here. □
Lemma 10.
Let p 1 ( mod 4 ) and f , g be given as Lemma 7. We suppose that s + t is odd. We write γ = 2 m s t and
B S q = # { ( a , b ) S f × S g : f ( a ) + g ( b ) S q , f ( a ) g ( b ) S q } , B N s q = # { ( a , b ) S f × S g : f ( a ) + g ( b ) N s q , f ( a ) g ( b ) N s q } .
Then, if 2 m s and 2 m t , we have
B S q = p 1 2 p γ 3 ( p 1 2 p γ 1 η ( 2 ) ε f p m t = = + p + 1 2 ε g p m s 1 + ( η ( 2 ) + p ) ε f ε g ) , B N s q = p 1 2 p γ 3 ( p 1 2 p γ 1 + η ( 2 ) ε f p m t = = + p + 1 2 ε g p m s 1 ( η ( 2 ) + p ) ε f ε g ) .
Otherwise, if 2 m s and 2 m t , we have
B S q = p 1 2 p γ 3 ( p 1 2 p γ 1 η ( 2 ) ε g p m s = = + p + 1 2 ε f p m t 1 + ( η ( 2 ) + p ) ε f ε g ) , B N s q = p 1 2 p γ 3 ( p 1 2 p γ 1 + η ( 2 ) ε g p m s = = + p + 1 2 ε f p m t 1 ( η ( 2 ) + p ) ε f ε g ) .
Proof. 
We only calculate B S q for the case 2 m s and 2 m t . Let f ( a ) + g ( b ) = u , f ( a ) g ( b ) = v , where u , v F p * . So, f ( a ) = u + v 2 , g ( b ) = u v 2 and consequently,
B S q = u S q v S q N f ( u + v 2 ) N g ( u v 2 ) ,
where N f and N g are computed in Lemma 6. It follows that
B S q = u S q N f ( u ) N g ( 0 ) + u S q N f ( 0 ) N g ( u ) + S ,
where
S = u S q v S q v ± u N f ( u + v 2 ) N g ( u v 2 ) .
We observe that u v 2 0 in (3). If we write c = u v 2 0 , then, from Lemma 6,
S = N g ( c ) u S q v S q v ± u N f ( u + v 2 ) = N g ( c ) u S q v S q v ± u p m s 1 + η ( u + v 2 ) ε f p m s 1 = N g ( c ) p 1 2 · p 5 2 p m s 1 + η ( 2 ) ε f p m s 1 u S q v S q v ± u η ( u + v ) .
The desired assertion then follows from Lemmas 6 and 9. □

4. Main Results

In this section, we will give our main results of the weight distributions of the desired linear codes C D f , g defined by (1) and (2). Let us fix some notation that will be used throughout this section. Let p 1 ( mod 4 ) and f , g WRP or f , g WRPB . For each α S f and β S g , we may assume from Lemma 3 that χ ^ f ( α ) = ε f p m + s ζ p f ( α ) and χ ^ g ( β ) = ε g p m + t ζ p g ( β ) , where ε f , ε g { ± 1 } and 0 s , t m . The indexes of f and g are l f and l g such that l f { 2 , p 1 } and l g = ( p 1 ) / 2 .
For ( a , b ) F q 2 { ( 0 , 0 ) } , we define
N 0 = # ( x , y ) F q 2 : Tr ( a x + b y ) = 0 , f ( x ) + g ( y ) = 0 .
In what follows, we always denote γ = 2 m s t and τ = 2 m + s + t for abbreviation purposes.

4.1. The Calculation of N 0

The values of N 0 in (4) are stated in Lemmas 11–13.
Lemma 11.
Let f , g WRP or f , g WRPB with l g = ( p 1 ) / 2 . We suppose that 2 s + t and ( a , b ) ( 0 , 0 ) . We always have N 0 = p 2 m 2 if ( a , b ) S f × S g . Otherwise, the following statements hold.
When l f = p 1 ,
N 0 = p 2 m 2 + p 1 2 η ( 2 ) ε f ε g p τ 3 , if f ( a ) S q , g ( b ) = ± f ( a ) , p 2 m 2 p 1 2 η ( 2 ) ε f ε g p τ 3 , if f ( a ) N s q , g ( b ) = ± f ( a ) , p 2 m 2 + ( p 1 ) ε f ε g p τ 3 , if f ( a ) + g ( b ) S q , f ( a ) g ( b ) S q , p 2 m 2 ( p 1 ) ε f ε g p τ 3 , if f ( a ) + g ( b ) N s q , f ( a ) g ( b ) N s q , p 2 m 2 , otherwise .
When l f = 2 and p 1 ( mod 8 ) ,
N 0 = p 2 m 2 + ( p 1 ) ε f ε g p τ 3 , if f ( a ) = 0 , g ( b ) S q or g ( b ) = 0 , f ( a ) S q , p 2 m 2 ( p 1 ) ε f ε g p τ 3 , if f ( a ) = 0 , g ( b ) N s q or g ( b ) = 0 , f ( a ) N s q , p 2 m 2 2 ( p 1 ) ε f ε g p τ 3 , if f ( a ) S q , g ( b ) S q , p 2 m 2 + 2 ( p 1 ) ε f ε g p τ 3 , if f ( a ) N s q , g ( b ) N s q , p 2 m 2 , otherwise .
When l f = 2 and p 5 ( mod 8 ) ,
N 0 = p 2 m 2 , if f ( a ) = g ( b ) = 0 , p 2 m 2 + ( p 1 ) ε f ε g p τ 3 , if f ( a ) = 0 , g ( b ) S q or g ( b ) = 0 , f ( a ) S q , p 2 m 2 ( p 1 ) ε f ε g p τ 3 , if f ( a ) = 0 , g ( b ) N s q or g ( b ) = 0 , f ( a ) N s q , p 2 m 2 + ε f ε g p τ 3 η ( f ( a ) ) I 4 g ( b ) f ( a ) η g ( b ) f ( a ) , otherwise ,
where I 4 is a companion sum determined in Lemma 1.
Proof. 
Let 2 s + t . By Equation (4) and the orthogonal property of group characters,
N 0 = 1 p 2 x , y F q z F p ζ p z ( f ( x ) + g ( y ) ) h F p ζ p h Tr ( a x + b y ) = 1 p 2 x , y F q 1 + z F p * ζ p z ( f ( x ) + g ( y ) ) 1 + h F p * ζ p h Tr ( a x + b y ) = p 2 m 2 + 1 p 2 z F p * x , y F q ζ p z ( f ( x ) + g ( y ) ) = = + 1 p 2 x , y F q z F p * h F p * ζ p z ( f ( x ) + g ( y ) ) + h Tr ( a x + b y ) = p 2 m 2 + p 2 ( Λ 1 + Λ 2 ) ,
where we write
Λ 1 = z F p * x , y F q ζ p z ( f ( x ) + g ( y ) ) , Λ 2 = x , y F q z F p * h F p * ζ p z ( f ( x ) + g ( y ) ) + h Tr ( a x + b y ) .
It follows that
Λ 1 = z F p * σ z χ ^ f ( 0 ) χ ^ g ( 0 ) = 0 , if   f , g WRPB , ε f ε g p τ z F p * η s + t ( z ) , if   f , g WRP .
So, we always have Λ 1 = 0 when 2 s + t . Now, it is sufficient to determine Λ 2 . We observe from its definition that
Λ 2 = z F p * h F p * x F q ζ p z f ( x ) Tr ( h a x ) y F q ζ p z g ( y ) Tr ( h b y ) = z F p * h F p * x F q ζ p z ( f ( x ) Tr ( h z a x ) ) y F q ζ p z ( g ( y ) Tr ( h z b y ) ) = z F p * h F p * σ z χ ^ f ( h a ) χ ^ g ( h b ) .
Let h F p * . Obviously, when ( a , b ) S f × S g , ( h a , h b ) S f × S g by Lemma 4. Hence, χ ^ f ( h a ) = 0 or χ ^ g ( h b ) = 0 , and consequently, by (6),
Λ 2 = 0 .
When ( a , b ) S f × S g , then ( h a , h b ) S f × S g . By (6), Lemmas 3 and 5, we obtain
Λ 2 = z F p * σ z h F p * ε f ε g p τ ζ p h l f f ( a ) + h l g g ( b ) ) = ε f ε g p τ z F p * η s + t ( z ) σ z h F p * ζ p h l f f ( a ) + h l g g ( b ) = ε f ε g p τ z F p * η ( z ) σ z h F p * ζ p h l f f ( a ) + h l g g ( b ) .
In the following, we will determine Λ 2 in (7) by considering the cases of l f = p 1 and l f = 2 , separately.
The first case is that l f = p 1 .
In this case, h p 1 = 1 for every h F p * . By (7), we have
Λ 2 = ε f ε g p τ z F p * η ( z ) σ z h S q ζ p f ( a ) + g ( b ) + h N s q ζ p f ( a ) g ( b ) = p 1 2 ε f ε g p τ z F p * η ( z ) ζ p z ( f ( a ) + g ( b ) ) + z F p * η ( z ) ζ p z ( f ( a ) g ( b ) ) = 0 , if f ( a ) = g ( b ) = 0 , p 1 2 ε f ε g η ( 2 f ( a ) ) p τ + 1 , if f ( a ) = g ( b ) 0 , p 1 2 ε f ε g η ( 2 f ( a ) ) p τ + 1 , if f ( a ) = g ( b ) 0 , p 1 2 ε f ε g η ( f ( a ) + g ( b ) ) + η ( f ( a ) g ( b ) ) p τ + 1 , otherwise .
Now, let l f = 2 ; then, the proof is divided into two subcases.
Subcase (a): If p 1 ( mod 8 ) , then 1 C 0 ( 4 , p ) . So, from (7),
Λ 2 = ε f ε g p τ z F p * η ( z ) σ z h S q ζ p h 2 f ( a ) + g ( b ) + h N s q ζ p h 2 f ( a ) g ( b ) = ε f ε g p τ z F p * η ( z ) σ z h S q ζ p h 2 f ( a ) + g ( b ) + h N s q ζ p ( h 2 f ( a ) + g ( b ) ) = ε f ε g p τ z F p * η ( z ) h S q ζ p z ( h 2 f ( a ) + g ( b ) ) + z F p * η ( z ) h N s q ζ p z ( h 2 f ( a ) + g ( b ) ) .
Replacing z by z in the last double sum above, we obtain from Lemma 2 that
Λ 2 = ε f ε g p τ z F p * η ( z ) h F p * ζ p z ( h 2 f ( a ) + g ( b ) ) = ε f ε g p τ z F p * η ( z ) ζ p z g ( b ) h F p * ζ p z h 2 f ( a ) = 0 , if f ( a ) = g ( b ) = 0 , ( p 1 ) ε f ε g η ( g ( b ) ) p τ + 1 , if f ( a ) = 0 , g ( b ) 0 , ( p 1 ) ε f ε g η ( f ( a ) ) p τ + 1 , if f ( a ) 0 , g ( b ) = 0 , ( p 1 ) ε f ε g η ( f ( a ) ) + η ( g ( b ) ) p τ + 1 , otherwise .
Subcase (b): If p 5 ( mod 8 ) , then 1 C 2 ( 4 , p ) . So, from (7),
Λ 2 = ε f ε g p τ z F p * η ( z ) σ z h S q ζ p h 2 f ( a ) + g ( b ) + h N s q ζ p h 2 f ( a ) g ( b ) = ε f ε g p τ z F p * η ( z ) σ z h S q ζ p h 2 f ( a ) + g ( b ) + h S q ζ p ( h 2 f ( a ) + g ( b ) ) = 2 ε f ε g p τ z F p * η ( z ) σ z h S q ζ p h 2 f ( a ) + g ( b ) = 2 ε f ε g p τ h S q z F p * η ( z ) ζ p z ( h 2 f ( a ) + g ( b ) ) .
We assume that f ( a ) g ( b ) 0 . If g ( b ) f ( a ) C 2 ( 4 , p ) , then the equation h 2 f ( a ) + g ( b ) = 0 has exactly two solutions, h 1 and h 2 , in S q , where h 2 = h 1 . Otherwise, if g ( b ) f ( a ) C 2 ( 4 , p ) , then the inequality h 2 f ( a ) + g ( b ) 0 holds for all h in S q . Consequently, when f ( a ) g ( b ) 0 ,
Λ 2 = 2 ε f ε g p τ + 1 h S q η ( h 2 f ( a ) + g ( b ) ) = ε f ε g p τ + 1 h F p * η ( h 4 f ( a ) + g ( b ) ) = ε f ε g p τ + 1 η ( f ( a ) ) I 4 g ( b ) f ( a ) η g ( b ) f ( a ) ,
where I 4 is determined from Lemma 1. Thus, we conclude that
Λ 2 = 0 , if f ( a ) = g ( b ) = 0 , ( p 1 ) ε f ε g η ( g ( b ) ) p τ + 1 , if f ( a ) = 0 , g ( b ) 0 , ( p 1 ) ε f ε g η ( f ( a ) ) p τ + 1 , if f ( a ) 0 , g ( b ) = 0 , ε f ε g p τ + 1 η ( f ( a ) ) I 4 g ( b ) f ( a ) η g ( b ) f ( a ) , otherwise .
The desired conclusion then follows from (5), completing the proof. □
Lemma 12.
Let f , g WRP with l g = ( p 1 ) / 2 . We suppose that 2 s + t and ( a , b ) ( 0 , 0 ) . We always have N 0 = p 2 m 2 + ( p 1 ) ε f ε g p τ 4 if ( a , b ) S f × S g . Otherwise, the following statements hold.
When l f = p 1 , we have
N 0 = p 2 m 2 + ( p 1 ) ε f ε g p τ 2 , if f ( a ) = g ( b ) = 0 , p 2 m 2 + p 1 2 ε f ε g p τ 2 , if f ( a ) = g ( b ) 0 or f ( a ) = g ( b ) 0 , p 2 m 2 , otherwise .
When l f = 2 and p 1 ( mod 8 ) , we have
N 0 = p 2 m 2 + ( p 1 ) ε f ε g p τ 2 , if f ( a ) = g ( b ) = 0 , p 2 m 2 + 2 ε f ε g p τ 2 , if f ( a ) g ( b ) S q , p 2 m 2 , otherwise .
When l f = 2 and p 5 ( mod 8 ) , we have
N 0 = p 2 m 2 + ( p 1 ) ε f ε g p τ 2 , if f ( a ) = g ( b ) = 0 , p 2 m 2 + 4 ε f ε g p τ 2 , if g ( b ) f ( a ) C 2 ( 4 , p ) , p 2 m 2 , otherwise .
Proof. 
The proof is completed in a manner analogous to the previous lemma by noting that 2 s + t . Now, let ( a , b ) S f × S g . From (5)–(7),
N 0 = p 2 m 2 + p 2 ( Λ 1 + Λ 2 ) ,
where
Λ 1 = ( p 1 ) ε f ε g p τ , Λ 2 = ε f ε g p τ z F p * σ z h F p * ζ p h l f f ( a ) + h l g g ( b ) .
It is sufficient to determine Λ 2 .
The first case is that l f = p 1 .
Again, from (7), we have
Λ 2 = p 1 2 ε f ε g p τ z F p * ζ p z ( f ( a ) + g ( b ) ) + z F p * ζ p z ( f ( a ) g ( b ) ) = ( p 1 ) 2 ε f ε g p τ , if f ( a ) = g ( b ) = 0 , p 1 2 ( p 2 ) ε f ε g p τ , if f ( a ) = g ( b ) 0 or f ( a ) = g ( b ) 0 , ( p 1 ) ε f ε g p τ , otherwise .
The second case is that l f = 2 where we only need to consider two different subcases.
Subcase (a): If p 1 ( mod 8 ) , then, from (7),
Λ 2 = ε f ε g p τ z F p * h F p * ζ p z ( h 2 f ( a ) + g ( b ) ) = ε f ε g p τ z F p * ζ p z g ( b ) h F p * ζ p z h 2 f ( a ) = ( p 1 ) 2 ε f ε g p τ , if f ( a ) = g ( b ) = 0 , ( p + 1 ) ε f ε g p τ , if f ( a ) g ( b ) S q , ( p 1 ) ε f ε g p τ , otherwise .
Subcase (b): If p 5 ( mod 8 ) , then, from (7),
Λ 2 = 2 ε f ε g p τ h S q z F p * ζ p z ( h 2 f ( a ) + g ( b ) ) .
The value of Λ 2 is clear if f ( a ) g ( b ) = 0 . We now assume that f ( a ) g ( b ) 0 . If g ( b ) f ( a ) C 2 ( 4 , p ) ; then, the equation h 2 f ( a ) + g ( b ) = 0 has exactly two solutions, h 1 and h 2 , in S q , where h 2 = h 1 . Hence,
Λ 2 = 2 ε f ε g p τ 2 ( p 1 ) ( p 1 2 2 ) = ( 3 p + 1 ) ε f ε g p τ .
Otherwise, if g ( b ) f ( a ) C 2 ( 4 , p ) , then the inequality h 2 f ( a ) + g ( b ) 0 holds for all h in S q . Thus,
Λ 2 = 2 ε f ε g p τ × p 1 2 × ( 1 ) = ( p 1 ) ε f ε g p τ .
So, we conclude that
Λ 2 = ( p 1 ) 2 ε f ε g p τ , if f ( a ) = g ( b ) = 0 , ( 3 p + 1 ) ε f ε g p τ , if g ( b ) f ( a ) C 2 ( 4 , p ) , ( p 1 ) ε f ε g p τ , otherwise .
The desired conclusion then follows from (5), completing the proof. □
Lemma 13.
Let f , g WRPB with l g = ( p 1 ) / 2 . We suppose that 2 s + t and ( a , b ) ( 0 , 0 ) . We always have N 0 = p 2 m 2 if ( a , b ) S f × S g . Otherwise, the value of N 0 is presented in the following.
When l f = p 1 , we have
N 0 = p 2 m 2 + ( p 1 ) 2 ε f ε g p τ 4 , if f ( a ) = g ( b ) = 0 , p 2 m 2 + p 1 2 ( p 2 ) ε f ε g p τ 4 , if f ( a ) = g ( b ) 0 or f ( a ) = g ( b ) 0 , p 2 m 2 ( p 1 ) ε f ε g p τ 4 , otherwise .
When l f = 2 and p 1 ( mod 8 ) , we have
N 0 = p 2 m 2 + ( p 1 ) 2 ε f ε g p τ 4 , if f ( a ) = g ( b ) = 0 , p 2 m 2 + ( p + 1 ) ε f ε g p τ 4 , if f ( a ) g ( b ) S q , p 2 m 2 ( p 1 ) ε f ε g p τ 4 , otherwise .
When l f = 2 and p 5 ( mod 8 ) , we have
N 0 = p 2 m 2 + ( p 1 ) 2 ε f ε g p τ 4 , if f ( a ) = g ( b ) = 0 , p 2 m 2 + ( 3 p + 1 ) ε f ε g p τ 4 , if g ( b ) f ( a ) C 2 ( 4 , p ) , p 2 m 2 ( p 1 ) ε f ε g p τ 4 , otherwise .
Proof. 
We note that Λ 1 = z F p * σ z χ ^ f ( 0 ) χ ^ g ( 0 ) = 0 for f , g WRPB . From (5), N 0 = p 2 m 2 + p 2 ( Λ 1 + Λ 2 ) = p 2 m 2 + p 2 Λ 2 , where Λ 2 is given in Lemma 12. This completes the proof. □

4.2. Weight Distributions of C D f , g from WRP or WRPB

The weight distributions of C D f , g defined by (1) and (2) are given in the following theorems explicitly. We recall that the length of C D f , g , denoted by n, is already settled in Lemma 8.
Theorem 1.
We suppose that 2 s + t , f , g WRP or f , g WRPB with l g = ( p 1 ) / 2 . Then, the code C D f , g has parameters [ p 2 m 1 1 , 2 m ] and its weight distribution is summarized in Table 1 if l f = p 1 , in Table 2 if l f = 2 and p 1 ( mod 8 ) and in Table 3 if l f = 2 and p 5 ( mod 8 ) .
Proof. 
From Lemma 8, the length is n = p 2 m 1 1 . Let ( a , b ) ( 0 , 0 ) and we write wt ( c ( a , b ) ) to be the weight of nonzero codewords c ( a , b ) . Clearly,
wt ( c ( a , b ) ) = n + 1 N 0 ,
where N 0 is given by Lemma 11. To be more precise, if ( a , b ) S f × S g , then
wt ( c ( a , b ) ) = ( p 1 ) p 2 m 2 .
For each ( a , b ) S f × S g , there are four different cases when the weight of c ( a , b ) does not equal ( p 1 ) p 2 m 2 .
When l f = p 1 , we have
wt ( c ( a , b ) ) = ( p 1 ) p 2 m 2 1 2 η ( 2 ) ε f ε g p τ 3 , E 1 times , ( p 1 ) p 2 m 2 + 1 2 η ( 2 ) ε f ε g p τ 3 , E 2 times , ( p 1 ) p 2 m 2 ε f ε g p τ 3 , B S q times , ( p 1 ) p 2 m 2 + ε f ε g p τ 3 , B N s q times ,
where the numbers B S q and B N s q are computed in Lemma 10, and
E 1 = # { ( a , b ) S f × S g : f ( a ) S q , g ( b ) = ± f ( a ) } = ( p 1 ) N f ( i ) N g ( i ) , E 2 = # { ( a , b ) S f × S g : f ( a ) N s q , g ( b ) = ± f ( a ) } = ( p 1 ) N f ( j ) N g ( j ) ,
with i S q , j N s q , and N f and N g are given in Lemma 6. The weight distribution in Table 1 is then established.
When l f = 2 and p 1 ( mod 8 ) , we have
wt ( c ( a , b ) ) = ( p 1 ) p 2 m 2 ε f ε g p τ 3 , E 3 times , ( p 1 ) p 2 m 2 + ε f ε g p τ 3 , E 4 times , ( p 1 ) p 2 m 2 + 2 ε f ε g p τ 3 , ( p 1 ) 2 4 N f ( i ) N g ( i ) times , ( p 1 ) p 2 m 2 2 ε f ε g p τ 3 , ( p 1 ) 2 4 N f ( j ) N g ( j ) times ,
where
E 3 = # { ( a , b ) S f × S g : f ( a ) = 0 , g ( b ) S q } + # { ( a , b ) S f × S g : g ( b ) = 0 , f ( a ) S q } = p 1 2 N f ( 0 ) N g ( i ) + N f ( i ) N g ( 0 ) , E 4 = # { ( a , b ) S f × S g : f ( a ) = 0 , g ( b ) N s q } + # { ( a , b ) S f × S g : g ( b ) = 0 , f ( a ) N s q } = p 1 2 N f ( 0 ) N g ( j ) + N f ( j ) N g ( 0 ) ,
for i S q and j N s q . The above argument leads to Table 2.
When l f = 2 and p 5 ( mod 8 ) , we have
wt ( c ( a , b ) ) = ( p 1 ) p 2 m 2 ε f ε g p τ 3 , E 3 times , ( p 1 ) p 2 m 2 + ε f ε g p τ 3 , E 4 times , c ( p 1 ) p 2 m 2 ε f ε g p τ 3 η ( u ) I 4 v u η v u for   all u , v F p * , N f ( u ) N g ( v ) times .
The weight distribution in this case is concluded in Table 3. □
Theorem 2.
We suppose that 2 s + t and f , g WRP with l g = ( p 1 ) / 2 . Then, C D f , g is an [ n , 2 m ] linear code and the weight distribution is given in Table 4 if l f = p 1 , in Table 5 if l f = 2 and p 1 ( mod 8 ) and in Table 6 if l f = 2 and p 5 ( mod 8 ) . Here, we set n = p 2 m 1 1 + ( p 1 ) ε f ε g p τ 2 for brevity.
Proof. 
The length of this code comes from Lemma 8. For ( a , b ) ( 0 , 0 ) , the weight wt ( c ( a , b ) ) = n + 1 N 0 can be obtained from Lemma 12. To be more explicit, when ( a , b ) S f × S g ,
wt ( c ( a , b ) ) = ( p 1 ) p 2 m 2 + ( p 1 ) ε f ε g p τ 4 .
The frequency of such codewords equals p 2 m p γ since f , g WRP . When ( a , b ) S f × S g { ( 0 , 0 ) } , we will discuss four different cases.
When l f = p 1 , we have
wt ( c ( a , b ) ) = ( p 1 ) p 2 m 2 , N f ( 0 ) N g ( 0 ) 1 times , ( p 1 ) p 2 m 2 + 1 2 ε f ε g p τ 2 , F 1 times , ( p 1 ) p 2 m 2 + ε f ε g p τ 2 , F 2 times ,
where we define
F 1 = # { ( a , b ) S f × S g : f ( a ) 0 , g ( b ) = ± f ( a ) } = 2 c F p * N f ( c ) N g ( c ) , F 2 = p γ N f ( 0 ) N g ( 0 ) F 1 .
Thus, we obtain the weight distribution in Table 4.
When l f = 2 and p 1 ( mod 8 ) , we have
wt ( c ( a , b ) ) = ( p 1 ) p 2 m 2 , N f ( 0 ) N g ( 0 ) 1 times , ( p 1 ) p 2 m 2 + ( p 3 ) ε f ε g p τ 2 , F 3 times , ( p 1 ) p 2 m 2 + ε f ε g p τ 2 , F 4 times ,
where
F 3 = # { ( a , b ) S f × S g : f ( a ) g ( b ) S q } = ( p 1 ) 2 4 ( N f ( i ) N g ( i ) + N f ( j ) N g ( j ) ) , F 4 = p γ N f ( 0 ) N g ( 0 ) F 3 ,
for i S q and j N s q . This implies the weight distribution listed in Table 5.
When l f = 2 and p 5 ( mod 8 ) , we get
wt ( c ( a , b ) ) = ( p 1 ) p 2 m 2 , N f ( 0 ) N g ( 0 ) 1 times , ( p 1 ) p 2 m 2 + ( p 5 ) ε f ε g p τ 2 , F 5 times , ( p 1 ) p 2 m 2 + ε f ε g p τ 2 , F 6 times ,
where we write
F 5 = # { ( a , b ) S f × S g : g ( b ) f ( a ) C 2 ( 4 , p ) } = ( p 1 ) 2 8 ( N f ( i ) N g ( i ) + N f ( j ) N g ( j ) ) = 1 2 F 3 , F 6 = p γ N f ( 0 ) N g ( 0 ) 1 2 F 3 ,
for i S q and j N s q . Thus, the result in Table 6 is derived. □
Theorem 3.
We suppose that 2 s + t and f , g WRPB with l g = ( p 1 ) / 2 . Then, C D f , g is a [ p 2 m 1 1 , 2 m ] linear code with its weight distribution given in Table 7 if l f = p 1 , in Table 8 if l f = 2 and p 1 ( mod 8 ) and in Table 9 if l f = 2 and p 5 ( mod 8 ) .
Proof. 
We note that ( 0 , 0 ) is not in S f × S g since f , g WRPB . This theorem can be derived in the same way as Theorem 2 by using Lemmas 6–8 and 13. We omitted the details here. □
Remark 3.
In Theorems 1, 2 and 3, we completely presented the weight distributions of C D f , g for f , g WRP or f , g WRPB with l f { 2 , p 1 } and l g = ( p 1 ) / 2 , where p 1 ( mod 4 ) . The case l f = l g = ( p 1 ) / 2 is not considered here, since the results for this case will be the same as for l f = l g = 2 or l f = l g = p 1 and they were determined in [17] (see Tables 3, 4 and 6).
Remark 4.
For s + t is odd, it is interesting to see that the codes have the same weight distributions whenever the functions are balanced or unbalanced. When s + t is even and f , g WRP and p 1 ( mod 8 ) , the weight distribution in Table 5 coincides with [17] (see Theorem 3.17, Table 5). If we set t = s in Table 5, then the result coincides with [3] (see Theorem 4, Tables 9 and 10). When s + t is even and f , g WRPB and p 1 ( mod 8 ) , the weight distribution in Table 8 coincides with [17] (see Theorem 3.21, Table 7). However, this is not the case for p 5 ( mod 8 ) . Nevertheless, the index ( p 1 ) / 2 is not considered in the literature. Moreover, most of our results, such as Table 1, Table 2, Table 3, Table 4, Table 6, Table 7 and Table 9, are not contained in [3,17].
Now, we will provide some examples from weakly regular unbalanced plateaued functions to illustrate the results in Theorems 1 and 2.
Example 1.
Let f , g : F 5 3 F 5 be defined as f ( x ) = Tr ( x 6 + x 2 ) and g ( y ) = Tr ( θ y 6 + θ 3 y 2 ) for a primitive element θ of F 5 3 * . Then, f , g WRP with s = 0 , t = 1 , ε f = 1 , ε g = 1 , l f = l g = 2 , χ ^ f ( α ) { 5 3 ζ 5 f ( α ) } and χ ^ g ( β ) { 0 , 5 2 ζ 5 g ( β ) } , where α , β F 5 3 and f ( 0 ) = g ( 0 ) = 0 . Actually, the function f is quadratic bent and its Walsh transform satisfies | χ ^ f ( α ) | 2 = 125 . From Magma programs, the code C D f , g is a three-weight code with parameters [ 3124 , 6 , 2400 ] and the weight enumerator 1 + 1300 z 2400 + 13124 z 2500 + 1200 z 2600 . This is verified by Table 3 in Theorem 1 noting that I 4 ( 1 ) = 3 , I 4 ( 2 ) = 5 , I 4 ( 3 ) = 3 and I 4 ( 4 ) = 1 .
Example 2.
Let f , g : F 5 4 F 5 be defined as f ( x ) = Tr ( x 6 ) and g ( y ) = Tr ( y 26 y 2 ) . Then, f , g WRP with s = t = 2 , ε f = 1 , ε g = 1 and l f = l g = 2 . Their Walsh transforms satisfy χ ^ f ( α ) { 0 , 5 3 ζ 5 f ( α ) } and χ ^ g ( β ) { 0 , 5 3 ζ 5 g ( β ) } , where α , β F 5 4 and f ( 0 ) = g ( 0 ) = 0 . From Magma programs, the code C D f , g is a three-weight code with parameters [ 65624 , 8 , 50000 ] and the weight enumerator 1 + 520 z 50000 + 390000 z 52500 + 104 z 62500 . This is verified by Table 6 in Theorem 2.
Example 3.
Let f , g : F 5 2 F 5 be defined as f ( x ) = Tr ( x 2 ) and g ( y ) = Tr ( θ y 2 θ y 6 ) for a primitive element θ of F 5 2 * . Then, f , g are quadratic bent functions in the set WRP , with s = t = 0 , ε f = 1 , ε g = 1 , l f = l g = 2 , χ ^ f ( α ) { 5 ζ 5 f ( α ) } and χ ^ g ( β ) { 5 ζ 5 g ( β ) } , where α , β F 5 2 and f ( 0 ) = g ( 0 ) = 0 . From Magma programs, the code C D f , g is a two-weight code with parameters [ 104 , 4 , 80 ] and the weight enumerator 1 + 520 z 80 + 104 z 100 . This is also verified by Table 6 in Theorem 2.

5. Minimality of the Codes and Their Applications

This section is devoted to analyzing the minimality of our codes C D f , g defined by (1) and (2), and then applying them to construct secret sharing schemes.
A linear code C over F p is called minimal if every nonzero codeword c solely covers its scalar multiples z c for z F p * . In 1998, Ashikhmin and Barg [24] provided a sufficient condition for a linear code to be minimal, that is,
w m i n w m a x > p 1 p ,
where w m i n and w m a x represent the minimum and maximum nonzero weights, respectively.
Now, we will show the minimality of the constructed linear codes in Theorems 1–3.
Theorem 4.
( 1 ) The linear codes with weight distributions in Table 1 and Table 2 are minimal, if γ 5 .
( 2 ) The linear codes with weight distributions in Table 4, Table 5 and Table 6 are minimal, if ε f ε g = 1 and γ 4 , or if ε f ε g = 1 and γ 6 .
( 3 ) The linear codes with weight distributions in Table 7, Table 8 and Table 9 are minimal, if γ 4 .
It should be noted that the minimum distance of C D f , g equals 2 since there are two linearly dependent entries in each codeword in C D f , g . Additionally, under the framework stated in [25,26], the minimal codes described in Theorem 4 can be employed to construct secret sharing schemes with good access structure.
Theorem 5
(Proposition 2, [26]). Let C be an [ n , k ] code over F q , and let G = [ g 0 , g 1 , , g n 1 ] be its generator matrix. If C is minimal, then in the secret sharing schemes based on the dual code C , there are altogether q k 1 minimal access sets. In addition, we have the following assertions:
(1) 
If g i is a multiple of g 0 , 1 i n 1 , then participant P i must be in every minimal access set. Such a participant is called a dictatorial participant.
(2) 
If g i is not a multiple of g 0 , 1 i n 1 , then participant P i must be in ( q 1 ) q k 2 out of q k 1 minimal access sets.
According to Theorem 5, we give the following example for secret sharing schemes.
Example 4.
Let f , g : F 5 4 F 5 be defined as f ( x ) = Tr ( x 6 ) and g ( y ) = Tr ( y 6 ) . Then, f , g WRP with s = t = 2 , ε f = ε g = 1 and l f = l g = 2 . From Table 6 in Theorem 2, the code C D f , g is a three-weight code with parameters [ 90624 , 8 , 62500 ] and the weight enumerator 1 + 144 z 62500 + 390000 z 72500 + 480 z 75000 . So, C D f , g is minimal by Theorem 4. Let G = [ g 0 , g 1 , , g 90623 ] be the generator matrix of C D f , g . Then, in the secret sharing scheme based on the dual code C D f , g , there are altogether 78,125 minimal access sets. In addition, we have the following assertions:
(1) 
If g i is a multiple of g 0 , 1 i 90,623, then participant P i must be in every minimal access set and P i is a dictatorial participant.
(2) 
If g i is not a multiple of g 0 , 1 i 90,623, then participant P i must be in 62,500 out of 78,125 minimal access sets.

6. Conclusions

In the literature, linear codes from weakly regular plateaued functions with index 2 and p 1 have been extensively studied, where p is a general prime number, see [3,16,17,18] and the references therein. However, the index of ( p 1 ) / 2 has not been considered before. In this paper, we took p 1 ( mod 4 ) and studied the construction of new linear codes from two weakly regular plateaued functions with new indexes 2, p 1 and ( p 1 ) / 2 . By calculating the exponential sums carefully, we succeeded in determining their weight distributions, as we had described in Theorems 1–3. Moreover, most of our codes are minimal and so they are suitable for designing secret sharing schemes. It should be noted that all the examples we gave are chosen from weakly regular unbalanced plateaued functions. Unfortunately, we have not found any weakly regular balanced plateaued functions until now. It would be very nice if someone found such a function in the future.

Author Contributions

Conceptualization, S.Y. and T.Z.; methodology, S.Y.; validation, T.Z. and Z.-a.Y.; writing—original draft preparation, S.Y.; writing—review and editing, S.Y. and T.Z.; visualization, Z.-a.Y.; supervision, S.Y. All authors have read and agreed to the published version of the manuscript.

Funding

This research was partially supported by the National Natural Science Foundation of China (Nos. 12071247, 12126609, 11971496), National Key R&D Program of China (No. 2020YFA0712500), Research and Innovation Fund for Graduate Dissertations of Qufu Normal University (No. LWCXS202251).

Institutional Review Board Statement

Not applicable.

Data Availability Statement

Data is contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Huffman, W.; Pless, V. Fundamentals of Error Correcting Codes; Cambridge University Press: Cambridge, UK, 2003. [Google Scholar]
  2. Calderbank, A.R.; Goethals, J.M. Three-weight codes and association schemes. Philips J. Res. 1984, 39, 143–152. [Google Scholar]
  3. Cheng, Y.J.; Cao, X.W. Linear codes with few weights from weakly regular plateaued functions. Discret. Math. 2021, 344, 112597. [Google Scholar] [CrossRef]
  4. Kong, X.L.; Yang, S.D. Complete weight enumerators of a class of linear codes with two or three weights. Discret. Math. 2019, 342, 3166–3176. [Google Scholar] [CrossRef]
  5. Mesnager, S.; Sınak, A. Several classes of minimal linear codes with few weights from weakly regular plateaued functions. IEEE Trans. Inf. Theory 2020, 66, 2296–2310. [Google Scholar] [CrossRef]
  6. Özbudak, F.; Pelen, R.M. Two or three weight linear codes from non-weakly regular bent functions. IEEE Trans. Inf. Theory 2022, 68, 3014–3027. [Google Scholar] [CrossRef]
  7. Sınak, A. Minimal linear codes from weakly regular plateaued balanced functions. Discret. Math. 2021, 344, 112215. [Google Scholar] [CrossRef]
  8. Yang, S.D. Complete weight enumerators of linear codes based on Weil sums. IEEE Commun. Lett. 2021, 25, 346–350. [Google Scholar] [CrossRef]
  9. Zhang, T.H.; Lu, H.; Yang, S.D. Two-weight and three-weight linear codes constructed from Weil sums. Math. Found. Comput. 2022, 5, 129–144. [Google Scholar] [CrossRef]
  10. Zheng, D.B.; Zhao, Q.; Wang, X.Q.; Zhang, Y. A class of two or three weights linear codes and their complete weight enumerators. Discret. Math. 2021, 344, 112355. [Google Scholar] [CrossRef]
  11. Heng, Z.L.; Li, D.X.; Du, J.; Chen, F.L. A family of projective two-weight linear codes. Des. Codes Cryptogr. 2021, 89, 1993–2007. [Google Scholar] [CrossRef]
  12. Tang, C.M.; Li, N.; Qi, Y.F.; Zhou, Z.C.; Helleseth, T. Linear codes with two or three weights from weakly regular bent functions. IEEE Trans. Inf. Theory 2016, 62, 1166–1176. [Google Scholar] [CrossRef]
  13. Tang, C.M.; Qi, Y.F.; Huang, D.M. Two-weight and three-weight linear codes from square functions. IEEE Commun. Lett. 2016, 20, 29–32. [Google Scholar] [CrossRef]
  14. Ding, C.S.; Niederreiter, H. Cyclotomic linear codes of order 3. IEEE Trans. Inf. Theory 2007, 53, 2274–2277. [Google Scholar] [CrossRef]
  15. Li, C.J.; Yue, Q.; Fu, F.W. A construction of several classes of two-weight and three-weight linear codes. Appl. Algebra Eng. Commun. Comput. 2017, 28, 11–30. [Google Scholar] [CrossRef]
  16. Wu, Y.N.; Li, N.; Zeng, X.Y. Linear codes with few weights from cyclotomic classes and weakly regular bent functions. Des. Codes Cryptogr. 2020, 88, 1255–1272. [Google Scholar] [CrossRef]
  17. Sınak, A. Construction of minimal linear codes with few weights from weakly regular plateaued functions. Turk. J. Math. 2022, 46, 953–972. [Google Scholar] [CrossRef]
  18. Yang, S.D.; Zhang, T.H.; Li, P. Linear codes from two weakly regular plateaued balanced functions. Entropy 2023, 25, 369. [Google Scholar] [CrossRef] [PubMed]
  19. Ireland, K.; Rosen, M. A Classical Introduction to Modern Number Theory; Springer: New York, NY, USA, 1990. [Google Scholar]
  20. Lidl, R.; Niederreiter, H. Finite Fields; Cambridge University Press: Cambridge, UK, 1997. [Google Scholar]
  21. Zheng, Y.L.; Zhang, X.M. Plateaued functions. In Proceedings of the International Conference on Information and Communications Security, Sydney, NSW, Australia, 9–11 November 1999; Springer: New York, NY, USA, 1999; pp. 284–300. [Google Scholar]
  22. Mesnager, S. Characterizations of plateaued and bent functions in characteristic p. In Proceedings of the International Conference on Sequences and Their Applications, SETA-2014, Melbourne, VIC, Australia, 24–28 November 2014; Springer: Cham, Switzerland, 2014; pp. 72–82. [Google Scholar]
  23. Mesnager, S.; Özbudak, F.; Sınak, A. Linear codes from weakly regular plateaued functions and their secret sharing schemes. Des. Codes Cryptogr. 2019, 87, 463–480. [Google Scholar] [CrossRef]
  24. Ashikhmin, A.; Barg, A. Minimal vectors in linear codes. IEEE Trans. Inf. Theory 1998, 44, 2010–2017. [Google Scholar] [CrossRef]
  25. Ding, C.S.; Yuan, J. Covering and secret sharing with linear codes. In Discrete Mathematics and Theoretical Computer Science; Springer: Berlin/Heidelberg, Germany, 2003; pp. 11–25. [Google Scholar]
  26. Yuan, J.; Ding, C.S. Secret sharing schemes from three classes of linear codes. IEEE Trans. Inf. Theory 2006, 52, 206–212. [Google Scholar] [CrossRef]
Table 1. The weight distribution of C D f , g in Theorem 1 when l f = p 1 .
Table 1. The weight distribution of C D f , g in Theorem 1 when l f = p 1 .
WeightFrequency
01
( p 1 ) p 2 m 2 p 2 m 1 E 1 E 2 B S q B N s q
( p 1 ) p 2 m 2 1 2 η ( 2 ) ε f ε g p τ 3 E 1
( p 1 ) p 2 m 2 + 1 2 η ( 2 ) ε f ε g p τ 3 E 2
( p 1 ) p 2 m 2 ε f ε g p τ 3 B S q
( p 1 ) p 2 m 2 + ε f ε g p τ 3 B N s q
Table 2. The weight distribution of C D f , g in Theorem 1 when l f = 2 and p 1 ( mod 8 ) .
Table 2. The weight distribution of C D f , g in Theorem 1 when l f = 2 and p 1 ( mod 8 ) .
WeightFrequency
01
( p 1 ) p 2 m 2 p 2 m 1 E 3 E 4 ( p 1 ) 2 4 N f ( i ) N g ( i ) + N f ( j ) N g ( j )
( p 1 ) p 2 m 2 ε f ε g p τ 3 E 3
( p 1 ) p 2 m 2 + ε f ε g p τ 3 E 4
( p 1 ) p 2 m 2 + 2 ε f ε g p τ 3 ( p 1 ) 2 4 N f ( i ) N g ( i )
( p 1 ) p 2 m 2 2 ε f ε g p τ 3 ( p 1 ) 2 4 N f ( j ) N g ( j )
Table 3. The weight distribution of C D f , g in Theorem 1 when l f = 2 and p 5 ( mod 8 ) .
Table 3. The weight distribution of C D f , g in Theorem 1 when l f = 2 and p 5 ( mod 8 ) .
WeightFrequency
01
( p 1 ) p 2 m 2 p 2 m 1 E 3 E 4 u , v F p * N f ( u ) N g ( v )
( p 1 ) p 2 m 2 ε f ε g p τ 3 E 3
( p 1 ) p 2 m 2 + ε f ε g p τ 3 E 4
( p 1 ) p 2 m 2 ε f ε g p τ 3 η ( u ) I 4 v u η v u
                         for all u , v F p *
N f ( u ) N g ( v )
Table 4. The weight distribution of C D f , g in Theorem 2 when l f = p 1 .
Table 4. The weight distribution of C D f , g in Theorem 2 when l f = p 1 .
WeightFrequency
01
( p 1 ) p 2 m 2 N f ( 0 ) N g ( 0 ) 1
( p 1 ) p 2 m 2 + 1 2 ε f ε g p τ 2 F 1
( p 1 ) p 2 m 2 + ε f ε g p τ 2 p γ N f ( 0 ) N g ( 0 ) F 1
( p 1 ) p 2 m 2 + ( p 1 ) ε f ε g p τ 4 p 2 m p γ
Table 5. The weight distribution of C D f , g in Theorem 2 when l f = 2 and p 1 ( mod 8 ) .
Table 5. The weight distribution of C D f , g in Theorem 2 when l f = 2 and p 1 ( mod 8 ) .
WeightFrequency
01
( p 1 ) p 2 m 2 N f ( 0 ) N g ( 0 ) 1
( p 1 ) p 2 m 2 + ( p 3 ) ε f ε g p τ 2 F 3
( p 1 ) p 2 m 2 + ε f ε g p τ 2 p γ N f ( 0 ) N g ( 0 ) F 3
( p 1 ) p 2 m 2 + ( p 1 ) ε f ε g p τ 4 p 2 m p γ
Table 6. The weight distribution of C D f , g in Theorem 2 when l f = 2 and p 5 ( mod 8 ) .
Table 6. The weight distribution of C D f , g in Theorem 2 when l f = 2 and p 5 ( mod 8 ) .
WeightFrequency
01
( p 1 ) p 2 m 2 N f ( 0 ) N g ( 0 ) 1
( p 1 ) p 2 m 2 + ( p 5 ) ε f ε g p τ 2 1 2 F 3
( p 1 ) p 2 m 2 + ε f ε g p τ 2 p γ N f ( 0 ) N g ( 0 ) 1 2 F 3
( p 1 ) p 2 m 2 + ( p 1 ) ε f ε g p τ 4 p 2 m p γ
Table 7. The weight distribution of C D f , g in Theorem 3 when l f = p 1 .
Table 7. The weight distribution of C D f , g in Theorem 3 when l f = p 1 .
WeightFrequency
01
( p 1 ) p 2 m 2 ( p 1 ) ε f ε g p τ 4 N f ( 0 ) N g ( 0 )
( p 1 ) p 2 m 2 p 2 2 ε f ε g p τ 4 F 1
( p 1 ) p 2 m 2 + ε f ε g p τ 4 p γ N f ( 0 ) N g ( 0 ) F 1
( p 1 ) p 2 m 2 p 2 m p γ 1
Table 8. The weight distribution of C D f , g in Theorem 3 when l f = 2 and p 1 ( mod 8 ) .
Table 8. The weight distribution of C D f , g in Theorem 3 when l f = 2 and p 1 ( mod 8 ) .
WeightFrequency
01
( p 1 ) p 2 m 2 ( p 1 ) ε f ε g p τ 4 N f ( 0 ) N g ( 0 )
( p 1 ) p 2 m 2 ( p + 1 ) ε f ε g p τ 4 F 3
( p 1 ) p 2 m 2 + ε f ε g p τ 4 p γ N f ( 0 ) N g ( 0 ) F 3
( p 1 ) p 2 m 2 p 2 m p γ 1
Table 9. The weight distribution of C D f , g in Theorem 3 when l f = 2 and p 5 ( mod 8 ) .
Table 9. The weight distribution of C D f , g in Theorem 3 when l f = 2 and p 5 ( mod 8 ) .
WeightFrequency
01
( p 1 ) p 2 m 2 ( p 1 ) ε f ε g p τ 4 N f ( 0 ) N g ( 0 )
( p 1 ) p 2 m 2 ( 3 p + 1 ) ε f ε g p τ 4 1 2 F 3
( p 1 ) p 2 m 2 + ε f ε g p τ 4 p γ N f ( 0 ) N g ( 0 ) 1 2 F 3
( p 1 ) p 2 m 2 p 2 m p γ 1
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Yang, S.; Zhang, T.; Yao, Z.-a. Linear Codes Constructed from Two Weakly Regular Plateaued Functions with Index (p − 1)/2. Entropy 2024, 26, 455. https://doi.org/10.3390/e26060455

AMA Style

Yang S, Zhang T, Yao Z-a. Linear Codes Constructed from Two Weakly Regular Plateaued Functions with Index (p − 1)/2. Entropy. 2024; 26(6):455. https://doi.org/10.3390/e26060455

Chicago/Turabian Style

Yang, Shudi, Tonghui Zhang, and Zheng-an Yao. 2024. "Linear Codes Constructed from Two Weakly Regular Plateaued Functions with Index (p − 1)/2" Entropy 26, no. 6: 455. https://doi.org/10.3390/e26060455

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop