Next Article in Journal
Fractional Advection Diffusion Models for Radionuclide Migration in Multiple Barriers System of Deep Geological Repository
Previous Article in Journal
Multisensor Fusion Estimation for Systems with Uncertain Measurements, Based on Reduced Dimension Hypercomplex Techniques
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Symbol-Triple Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths over Fq+uFq+u2Fq

1
Department of Mathematical Sciences, Kent State University, Warren, OH 44483, USA
2
Department of Mathematics, Faculty of Sciences Dhar El Mahraz, University Sidi Mohamed Ben Abdallah, B.P. 1796, Fès-Atlas, Fès 30003, Morocco
3
Centre of Excellence in Econometrics, Faculty of Economics, Chiang Mai University, Chiang Mai 52000, Thailand
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(14), 2496; https://doi.org/10.3390/math10142496
Submission received: 11 February 2022 / Revised: 2 July 2022 / Accepted: 11 July 2022 / Published: 18 July 2022

Abstract

:
Let p be an odd prime, where ϑ and m are positive integers. Let ψ be a nonzero element of the finite field F q , where q = p m , and R = F q + u F q + u 2 F q ( u 3 = 0 ) . In this paper, we determine completely the symbol-triple distances of all ψ -constacyclic codes of length p ϑ over R .

1. Introduction

High-density data storage systems are very popular nowadays due to their great advantages in simplifying and improving storage, saving money, and saving time. However, these systems still have restrictions on the combination of high density, rewriting capability, fast response, and long retention time. To overcome these restrictions in high-density data storage systems, a new metric, called symbol-pair metric, was introduced by Cassuto and Blaum in [1,2]. This metric is reasonable for channels for which outputs are overlapping pairs of symbols. After that, for the read channel output larger than 2, b 3 , Yaakobi et al. [3] introduced b-symbol metrics, which generalize the symbol-pair metric, and provided extensions of many results and code constructions. By putting b = 3 , we obtained the symbol-triple metric.
Consider R a finite commutative ring with unity. For a positive integer n, the number of nonzero entries of a codeword ζ = ( ζ 0 , ζ 1 , , ζ n 1 ) R n is the Hamming weight of ζ , denoted by w H ( ζ ) . Let ζ and ξ be two codewords, and their Hamming distance denoted by d H ( ζ , ξ ) is the number of their components which differ.
A codeword α = ( α 0 , α 1 , , α n 1 ) is represented in symbol-triple read channels as
π ( α ) = [ ( α 0 , α 1 , α 2 ) , ( α 1 , α 2 , α 3 ) , , ( α n 1 , α 0 , α 1 ) ] ( R 3 ) n .
The Hamming weight of the symbol-triple vector π ( α ) is called the symbol-triple weight of the vector α :
w st ( α ) = w H ( π ( α ) ) = | { 0 i n 1 : ( α i , α i + 1 , α i + 2 ) ( 0 , 0 , 0 ) , α n = α 0 } | .
For two vectors α = ( α 0 , α 1 , , α n 1 ) and β = ( β 0 , β 1 , , β n 1 ) in R n , the symbol-triple distance between them is:
d st ( α , β ) = d H ( π ( α ) , π ( β ) ) = | { 0 i n 1 : ( α i , α i + 1 , α i + 2 ) ( β i , β i + 1 , β i + 2 ) } | .
Then, for a code C, the symbol-triple distance is defined as
d st ( C ) = min { d st ( α , β ) α , β C , α β } .
For a linear code C, the symbol-triple distance and symbol-triple weight are coincided. They are defined as:
d st ( C ) = min { w st ( c ) c 0 , c C } .
Constacyclic codes are linear codes that have an important role in error-correcting codes theory, which can be viewed as a generalization of cyclic codes. They are preferred in engineering because of their rich algebraic structures that make them more practical, since they are efficiently encoded, and they provide efficient error detection and correction. Castagnoli et al. [4] and Van Lint [5] were the first to investigate constacyclic codes. For a unit ϕ of R, ϕ -constacyclic codes of length n over R are in one-to-one correspondence with ideals of the polynomial ring R [ x ] / x n ϕ . If n is divisible by the characteristic p of R, then we obtain the so-called repeated-root codes.
Let F q be a finite field of q = p m elements, where p is a prime, m is a positive integer and let λ 2 be an integer. Then, the ring R = F q [ u ] / u λ is a finite commutative chain ring. Many authors [6,7,8] studied algebraic structures of constacyclic codes over R:
For λ = 2 , many authors studied them (see, e.g., [9,10,11,12,13,14,15,16,17,18]). In particular, for a prime power length, their structure and their symbol-pair distance were completely established in [12,19].
For λ = 3 , DNA cyclic codes were studied in [20], which are of deep importance for biology. In [21], Laaouine et al. described the structure of all ψ -constacyclic codes of length p ϑ over R = F q + u F q + u 2 F q for a nonzero element ψ of F q and classified them into eight types. Then, their Hamming distances have been computed by Dinh et al. [22]. In [23], Charkani et al. computed their symbol-pair distances.
Accordingly, we resolve to compute the symbol-triple distance of all ψ -constacyclic codes of length p ϑ over R . After giving some preliminaries and notations in Section 2, Section 3 establishes their symbol-triple distance. Section 4 contains some examples by fixing some values for p and ϑ . Finally, a conclusion is given in Section 5.

2. Some Preliminaries

From now on in this paper, F q is the field of order q with q = p m where p is a prime positive integer, m is a positive integer, and we denote
R = F q + u F q + u 2 F q .
R is a finite chain ring, u = u R is its maximal ideal, and its invertible elements in are of the form: ψ + ρ u + χ u 2 where ψ , ρ , χ F q and ψ 0 .
Linear codes C of length n over R are defined as R -submodules of R n . For a unit ϕ in R , ϕ -constacyclic codes C of length n over R are the linear codes of length n over R , which satisfy the following property: ( a 0 , a 1 , , a n 1 ) C implies that ( ϕ a n 1 , a 0 , a 1 , , a n 2 ) C . Then, in order to study them, it suffices to study ideals of the ring R [ x ] / x n ϕ (cf. [24,25]).
So, for a unit ψ of F q , ψ -constacyclic codes of length p ϑ over R are exactly the ideals of
R ψ = R [ x ] / x p ϑ ψ .
In [21], Laaouine et al. classified and determined their structure:
Theorem 1
(cf. [21]). The ring R ψ is local finite non-chain ring, its maximal ideal is u , x φ , where φ F q such that φ p ϑ = ψ . ψ-constacyclic codes of length p ϑ over R (i.e., ideals of the ring R ψ ) are
Type 1 ( C 1 ) :
0 , 1 .
Type 2 ( C 2 ) :
C 2 = u 2 ( x φ ) a ,
where 0 a p ϑ 1 .
Type 3 ( C 3 ) :
C 3 = u ( x φ ) b + u 2 ( x φ ) t f ( x ) ,
where 0 A b p ϑ 1 , 0 t < A , either f ( x ) is 0 or f ( x ) is a unit in R ψ . Here, A is the smallest integer such that u 2 ( x φ ) A C 3 .
Type 4 ( C 4 ) :
C 4 = u ( x φ ) b + u 2 ( x φ ) t f ( x ) , u 2 ( x φ ) c ,
where 0 c < A b p ϑ 1 , 0 t < c , either f ( x ) is 0 or f ( x ) is a unit in R ψ , and A is the same as in Type 3 .
Type 5 ( C 5 ) :
C 5 = ( x φ ) α + u ( x φ ) t 1 f 1 ( x ) + u 2 ( x φ ) t 2 f 2 ( x ) ,
where 0 < C B α p ϑ 1 , 0 t 1 < B , 0 t 2 < C and f 1 ( x ) , f 2 ( x ) are 0 or are units in R ψ . Here, B being the smallest integer such that u ( x φ ) B + u 2 g ( x ) C 5 , for some g ( x ) R ψ and C is the smallest integer satisfying u 2 ( x φ ) C C 5 .
Type 6 ( C 6 ) :
C 6 = ( x φ ) α + u ( x φ ) t 1 f 1 ( x ) + u 2 ( x φ ) t 2 f 2 ( x ) , u 2 ( x φ ) γ ,
where 0 γ < C B α p ϑ 1 , 0 t 1 < B , 0 t 2 < γ and f 1 ( x ) , f 2 ( x ) are 0 or are units in R ψ . Here, B , C are the same as in Type 5 .
Type 7 ( C 7 ) :
C 7 = ( x φ ) α + u ( x φ ) t 1 f 1 ( x ) + u 2 ( x φ ) t 2 f 2 ( x ) ,   u ( x φ ) β + u 2 ( x φ ) t 3 f 3 ( x ) ,
where 0 D β < B α p ϑ 1 , 0 t 1 < β , 0 t 2 < D , 0 t 3 < D and f 1 ( x ) , f 2 ( x ) , f 3 ( x ) are 0 or are units in R ψ . Here, D is the smallest integer such that u 2 ( x φ ) D C 7 and B is the same as in Type 5 .
Type 8 ( C 8 ) :
C 8 = ( x φ ) α + u ( x φ ) t 1 f 1 ( x ) + u 2 ( x φ ) t 2 f 2 ( x ) , u ( x φ ) β + u 2 ( x φ ) t 3 f 3 ( x ) , u 2 ( x φ ) γ ,
where 0 γ < D β < B α p ϑ 1 , 0 t 1 < β , 0 t 2 < γ , 0 t 3 < γ and f 1 ( x ) , f 2 ( x ) , f 3 ( x ) are 0 or are units in R ψ . Here, B as in Type 5 and D is the same as in Type 7 .
Proposition 1
(cf. [21]). We have
A = b , i f f ( x ) = 0 , min { b , p ϑ b + t } , i f f ( x ) 0 . ,
B = α , i f f 1 ( x ) = 0 , min { α , p ϑ α + t 1 } , i f f 1 ( x ) 0 . ,
C = α , i f f 1 ( x ) = f 2 ( x ) = 0 , min { α , p ϑ α + t 2 } , i f f 1 ( x ) = 0 a n d f 2 ( x ) 0 , min { α , p ϑ α + t 1 } , i f f 1 ( x ) 0 .
D = β , i f f 1 ( x ) = f 2 ( x ) = f 3 ( x ) = 0 o r f 1 ( x ) 0 a n d f 3 ( x ) = 0 , min { β , p ϑ α + t 2 } , i f f 1 ( x ) = f 3 ( x ) = 0 , f 2 ( x ) 0 , min { β , p ϑ β + t 3 } , i f f 1 ( x ) = f 2 ( x ) = 0 , f 3 ( x ) 0 o r f 1 ( x ) 0 a n d f 3 ( x ) 0 , min { β , p ϑ α + t 2 , p ϑ β + t 3 } , i f f 1 ( x ) = 0 , f 2 ( x ) 0 , f 3 ( x ) 0 .

3. Symbol-Triple Distance

This section will be devoted to determining the symbol-triple distances of all types of ψ -constacyclic codes of length p ϑ over R . Therefore, we recall the following result.
Theorem 2
(cf. [26]). Let C be a ψ-constacyclic code of length p ϑ over F q . Then, C = ( x φ ) ι   F q [ x ] / x p ϑ ψ , 0 ι p ϑ , and its symbol-triple distance Δ ι : = d st ( C ) is determined by:
Δ ι = 3 , i f ι = 0 ; 7 , i f ι = 4 a n d where p = 3 , s = 2 ; 4 p η , i f ι = p ϑ p ϑ η + 1 , where 0 η ϑ 2 ; 5 p η , i f ι = p ϑ p ϑ η + 2 , where 0 η ϑ 2 ; 6 p η , i f p ϑ p ϑ η + 3 ι p ϑ p ϑ η + p ϑ η 1 , where 0 η ϑ 2 ; 8 p η , i f ι = p ϑ p ϑ η + p ϑ η 1 + 1 , where 0 η ϑ 2 a n d s 3 ; 9 p η , i f p ϑ p r + r + 2 ι p ϑ p r + 2 r , where r = p ϑ η 1 , 0 η ϑ 2 a n d p 5 ; 3 ( τ + 2 ) p η , i f p ϑ p r + τ r + 1 ι p ϑ p r + ( τ + 1 ) r , where r = p ϑ η 1 , 0 η ϑ 2 , a n d 2 τ p 2 ; ( ϱ + 3 ) p ϑ 1 , i f ι = p ϑ p + ϱ , where 1 ϱ p 3 ; p ϑ , i f p ϑ 2 ι p ϑ 1 ; 0 , i f ι = p ϑ .
For a code C over R , the symbol-triple distance is denoted by Δ ι : = d st ( C F ) .
Now, for each type of ψ -constacyclic codes of length p ϑ over R , we compute the symbol-triple distance one by one.
Type 1 consists only of the trivial ideals 0 , 1 . Hence, they have symbol-triple distances of 0 and 3, respectively.
The codewords of a code C 2 = u 2 ( x φ ) a of Type 2 with 0 a p s 1 are exactly those of the ψ -constacyclic codes ( x φ ) a in F q [ x ] / x p ϑ ψ multiplied by u 2 . Thus, we obtain d st ( C 2 ) = d st ( ( x φ ) a F ) and Theorem 2 gives it.
Theorem 3.
For a ψ-constacyclic code C 2 = u 2 ( x φ ) a , 0 a p ϑ 1 of Type 2 . The symbol-triple distance d st ( C 2 ) is given by
d st ( C 2 ) = Δ a , where 0 a p ϑ 1 .
Now, we are going to calculate the symbol-triple distances of codes of Type 3 , 4 , 5 , 6 , 7 and 8 . To do this, notice that
wt st ( Γ ( x ) ) wt st ( u Γ ( x ) ) ,
where Γ ( x ) R ψ .
The symbol-triple distance ψ -constacyclic codes of Type 3 can be calculated by the next theorem:
Theorem 4.
Let C 3 = u ( x φ ) b + u 2 ( x φ ) t f ( x )   R ψ be of Type 3 . The symbol-triple distance d st ( C 3 ) of C 3 is given by
d st ( C 3 ) = Δ A , w h e r e 0 A p ϑ 1 .
Proof. 
Let Υ ( x ) be an arbitrary nonzero element of C 3 . That means that there exists Υ 0 ( x ) , Υ u ( x ) ,
  • Υ u 2 ( x ) F q [ x ] verifying
Υ ( x ) = [ Υ 0 ( x ) + u Υ u ( x ) + u 2 Υ u 2 ( x ) ] [ u ( x φ ) b + u 2 ( x φ ) t f ( x ) ] .
Thus,
u Υ ( x ) = u 2 Υ 0 ( x ) ( x φ ) b .
By (1), we obtain that
wt st ( Υ ( x ) ) wt st ( u Υ ( x ) ) = wt st ( u 2 Υ 0 ( x ) ) ( x φ ) b ) d st ( u 2 ( x φ ) b ) = d st ( ( x φ ) b F ) .
Since ( x φ ) b   ( x φ ) A , we have
d st ( ( x φ ) b F ) d st ( ( x φ ) A F ) .
It follows that wt st ( Υ ( x ) ) d st ( ( x φ ) A F ) for any nonzero element Υ ( x ) of C 3 . Then,
d st ( C 3 ) d st ( ( x φ ) A F ) .
Moreover, we have
u 2 ( x φ ) A   C 3 ,
it follows that
d st ( ( x φ ) A F ) = d st ( u 2 ( x φ ) A ) d st ( C 3 ) .
Then, by combining (2) and (3), we obtain
d st ( C 3 ) = d st ( ( x φ ) A F ) = Δ A , where 0 A p ϑ 1 .
This proves the theorem. □
Now, let us show the symbol-triple distance for Type 4 .
Theorem 5.
For ψ-constacyclic code C 4 = u ( x φ ) b + u 2 ( x φ ) t f ( x ) , u 2 ( x φ ) c of Type 4 , the symbol-triple distance d st ( C 4 ) is given by
d st ( C 4 ) = Δ c , where 0 c < p ϑ 1 .
Proof. 
At first, since u 2 ( x φ ) c C 4 , we obtain
d st ( C 4 ) d st ( u 2 ( x φ ) c ) = d st ( ( x φ ) c F ) .
To prove that d st ( ( x φ ) c F ) d st ( C 4 ) , let Υ ( x ) C 4 \ u 2 ( x φ ) c , we should prove that wt st ( Υ ( x ) ) d st ( ( x φ ) c F ) .
By (1), we obtain that
wt st ( Υ ( x ) ) wt st ( u Υ ( x ) ) d st ( u 2 ( x φ ) b ) = d st ( ( x φ ) b F ) d st ( ( x φ ) c F ) ( because ( x φ ) b   ( x φ ) c ) .
Hence, d st ( ( x φ ) c F ) d st ( C 4 ) , forcing
d st ( C 4 ) = d st ( ( x φ ) c F ) = Δ c , where 0 c < p ϑ 1 .
This proves the theorem. □
Now, we calculate the symbol-triple distance for Type 5 :
Theorem 6.
For a ψ-constacyclic code C 5 = ( x φ ) α + u ( x φ ) t 1 f 1 ( x ) + u 2 ( x φ ) t 2 f 2 ( x )   R ψ of Type 5 , the symbol-triple distance d st ( C 5 ) is given by
d st ( C 5 ) = Δ C , where 0 < C p ϑ 1 .
Proof. 
Let C 5 = ( x φ ) α + u ( x φ ) t 1 f 1 ( x ) + u 2 ( x φ ) t 2 f 2 ( x ) be of Type 5 . Now, for each nonzero Υ ( x ) C 5 , there exist Υ 0 ( x ) , Υ u ( x ) , Υ u 2 ( x ) F q [ x ] such that
Υ ( x ) = [ Υ 0 ( x ) + u Υ u ( x ) + u 2 Υ u 2 ( x ) ] [ ( x φ ) α + u ( x φ ) t 1 f 1 ( x ) + u 2 ( x φ ) t 2 f 2 ( x ) ] .
Thus,
u 2 Υ ( x ) = u 2 Υ 0 ( x ) ( x φ ) α .
By (1), we see that
wt st ( Υ ( x ) ) wt st ( u 2 Υ ( x ) ) = wt st ( u 2 Υ 0 ( x ) ( x φ ) α ) d st ( u 2 ( x φ ) α ) = d st ( ( x φ ) α F ) .
The fact that ( x φ ) α   ( x φ ) C follows that
d st ( ( x φ ) α F ) d st ( ( x φ ) C F ) .
This implies that d st ( ( x φ ) C F ) d st ( C 5 ) .
Moreover, we have that
u 2 ( x φ ) C C 5 ,
then d st ( C 5 ) d st ( u 2 ( x φ ) C ) = d st ( ( x φ ) C F ) and we obtain
d st ( C 5 ) = d st ( ( x φ ) C F ) = Δ C , where 0 < C p ϑ 1 .
This proves the theorem. □
The symbol-triple distance for Type 6 can be established by the next theorem:
Theorem 7.
For a ψ-constacyclic code C 6 = ( x φ ) α + u ( x φ ) t 1 f 1 ( x ) + u 2 ( x φ ) t 2 f 2 ( x ) , u 2 ( x φ ) γ   R ψ of Type 6 , the symbol-triple distance d st ( C 6 ) is given by
d st ( C 6 ) = Δ γ , w h e r e 0 γ < p ϑ 1 .
Proof. 
At first, since u 2 ( x φ ) γ C 6 , we obtain
d st ( C 6 ) d st ( u 2 ( x φ ) γ ) = d st ( ( x φ ) γ F ) .
Now, let Υ ( x ) C 6 \ u 2 ( x φ ) γ . Thus, by (1), we find that
wt st ( Υ ( x ) ) wt st ( u 2 Υ ( x ) ) d st ( u 2 ( x φ ) α ) = d st ( ( x φ ) α F ) d st ( ( x φ ) γ F ) ( because ( x φ ) α   ( x φ ) γ ) .
Hence, d st ( ( x φ ) γ F ) d st ( C 6 ) , forcing
d st ( C 6 ) = d st ( ( x φ ) γ F ) = Δ γ , where 0 γ < p ϑ 1 .
This proves the theorem. □
Now, we show the symbol-triple distance for Type 7 .
Theorem 8.
For a ψ-constacyclic code C 7 = ( x φ ) α + u ( x φ ) t 1 f 1 ( x ) + u 2 ( x φ ) t 2 f 2 ( x ) , u ( x φ ) β + u 2 ( x φ ) t 3 f 3 ( x ) of Type 7 , the symbol-triple distance d st ( C 7 ) is given by
d st ( C 7 ) = Δ D , where 0 D < p ϑ 1 .
Proof. 
At first, since u 2 ( x φ ) D C 7 , we obtain
d st ( C 7 ) d st ( u 2 ( x φ ) D ) = d st ( ( x φ ) D F ) .
Now, let Υ ( x ) C 7 . Then, we distinguish two different cases.
Case 1 : if Υ ( x ) u , then by (1), we obtain
wt st ( Υ ( x ) ) wt st ( u Υ ( x ) ) d st ( u 2 ( x φ ) β ) = d st ( ( x φ ) β F ) .
Case 2 : if Υ ( x ) u , then by (1), we obtain
wt st ( Υ ( x ) ) wt st ( u 2 Υ ( x ) ) d st ( u 2 ( x φ ) α ) = d st ( ( x φ ) α F ) .
We have ( x φ ) α   ( x φ ) β   ( x φ ) D , then, we obtain
d st ( ( x φ ) α F ) d st ( ( x φ ) β F ) d st ( ( x φ ) D F ) .
Therefore, d st ( ( x φ ) D F ) d st ( C 7 ) , forcing
d st ( C 7 ) = d st ( ( x φ ) D F ) = Δ D , where 0 D < p ϑ 1 .
This completes the proof. □
Finally, we give the symbol-triple distance for Type 8 .
Theorem 9.
For a ψ-constacyclic code C 8 = ( x φ ) α + u ( x φ ) t 1 f 1 ( x ) + u 2 ( x φ ) t 2 f 2 ( x ) , u ( x φ ) β + u 2 ( x φ ) t 3 f 3 ( x ) , u 2 ( x φ ) γ   R ψ of Type 8 , the symbol-triple distance d st ( C 8 ) is given by
d st ( C 8 ) = Δ γ , where 0 γ < p ϑ 2 .
Proof. 
Let C 8 = ( x φ ) α + u ( x φ ) t 1 f 1 ( x ) + u 2 ( x φ ) t 2 f 2 ( x ) , u ( x φ ) β + u 2 ( x φ ) t 3 f 3 ( x ) , u 2 ( x φ ) γ be of Type 8 . In addition, consider an arbitrary polynomial Υ ( x ) C 8 \ u 2 ( x φ ) γ . Now, we distinguish two cases:
Case 1 : if Υ ( x ) u then by (1), we obtain
wt st ( Υ ( x ) ) wt st ( u Υ ( x ) ) d st ( u 2 ( x φ ) β ) = d st ( ( x φ ) β F ) d st ( ( x φ ) γ F ) ( because ( x φ ) β   ( x φ ) γ ) .
Case 2 : if Υ ( x ) u , then by (1), we obtain
wt st ( Υ ( x ) ) wt st ( u 2 Υ ( x ) ) d st ( u 2 ( x φ ) α ) = d st ( ( x φ ) α F ) d st ( ( x φ ) γ F ) ( because ( x φ ) α   ( x φ ) γ ) .
This implies that d st ( ( x φ ) γ F ) d st ( C 8 ) .
Moreover, we have that
u 2 ( x φ ) γ   C 8 ,
then d st ( C 8 ) d st ( u 2 ( x φ ) γ ) = d st ( ( x φ ) γ F ) and we obtain
d st ( C 8 ) = d st ( ( x φ ) γ F ) = Δ γ , where 0 γ < p ϑ 2 .
This completes the proof. □

4. Examples

This section is devoted to show some examples of symbol-triple distances of constacyclic codes of length p ϑ over F q + u F q + u 2 F q ( u 3 = 0 ) .
Example 1.
Consider the ring R = F 7 + u F 7 + u 2 F 7 , with p = 7 , m = 1 and ψ F 7 * . There are eight types of generators of ψ-constacyclic codes of length 49 over R . Then, for each type of generator, we give the symbol-triple distances:
Type 1 ( C 1 ) : 0 , 1 ,
d st ( 0 ) = 0 , d st ( 1 ) = 3 .
Type 2 ( C 2 ) : C 2 = u 2 ( x ψ ) a , 0 a 48 ; then, the symbol-triple distance, d st ( C 2 ) = Δ a , is presented in Table 1.
Type 3 ( C 3 ) : C 3 = u ( x ψ ) b + u 2 ( x ψ ) t f ( x ) , where f ( x ) is 0 or f ( x ) is a unit in R [ x ] / x 49 ψ , 0 b 48 , 0 t < b , and then the symbol-triple distance, d st ( C 3 ) = Δ A , where 0 A 48 , is presented in Table 2.
Type 4 ( C 4 ) : C 4 = u ( x ψ ) b + u 2 ( x ψ ) t f ( x ) , u 2 ( x ψ ) c , where f ( x ) is a unit in R [ x ] / x 49 ψ or 0, 0 c < b 48 , 0 t < c , then, the symbol-triple distance, d st ( C 4 ) = Δ c , where 0 c 47 , is presented in Table 3.
Type 5 ( C 5 ) : C 5 = ( x ψ ) α + u ( x ψ ) t 1 f 1 ( x ) + u 2 ( x ψ ) t 2 f 2 ( x ) , where f 1 ( x ) , f 2 ( x ) are 0 or are units in R [ x ] / x 49 ψ , 1 α 48 , 0 t 1 < α , 0 t 2 < α . Then, the symbol-triple distance, d st ( C 5 ) = Δ C , where 1 C 48 , is presented in Table 4.
Type 6 ( C 6 ) : C 6 = ( x ψ ) α + u ( x ψ ) t 1 f 1 ( x ) + u 2 ( x ψ ) t 2 f 2 ( x ) , u 2 ( x ψ ) γ , where f 1 ( x ) , f 2 ( x ) are 0 or are units in R [ x ] / x 49 ψ , 0 γ < α 48 , 0 t 1 < α , 0 t 2 < γ , then, the symbol-triple distance, d st ( C 6 ) = Δ γ , where 0 γ 47 , is presented in Table 5.
Type 7 ( C 7 ) : C 7 = ( x ψ ) α + u ( x ψ ) t 1 f 1 ( x ) + u 2 ( x ψ ) t 2 f 2 ( x ) , u ( x ψ ) β + u 2 ( x ψ ) t 3 f 3 ( x ) , where f 1 ( x ) , f 2 ( x ) , f 3 ( x ) are 0 or are units in R [ x ] / x 49 ψ , 0 β < α 48 , 0 t 1 < β , 0 t 2 < β , 0 t 3 < β . Then, the symbol-triple distance, d st = Δ D , where 0 D 47 , is presented in Table 6.
Type 8 ( C 8 ) : C 8 = ( x ψ ) α + u ( x ψ ) t 1 f 1 ( x ) + u 2 ( x ψ ) t 2 f 2 ( x ) , u ( x ψ ) β + u 2 ( x ψ ) t 3 f 3 ( x ) , u 2 ( x ψ ) γ , where f 1 ( x ) , f 2 ( x ) , f 3 ( x ) are 0 or are units in R [ x ] / x 49 ψ , 0 γ < β < α 48 , 0 t 1 < β , 0 t 2 < γ , 0 t 3 < γ , then, the symbol-triple distance, d st ( C 8 ) = Δ γ , where 0 γ 46 , is presented in Table 7.
Example 2.
Table 8 presents all ψ-constacyclic codes of length 3 over F 3 + u F 3 + u 2 F 3 , where ψ { 1 , 2 } , with their symbol-triple distances d st and their number of codewords | C | . In all codes, we have ν 0 , θ 0 { 1 , 2 } and θ 1 { 0 , 1 , 3 } .

5. Conclusions

In this research article, we determined all symbol-triple distances of ψ -constacyclic codes of length p ϑ over R = F q + u F q + u 2 F q , where ψ F q * , u 3 = 0 , q = p m and p 3 . For a given length and size, MDS symbol-triple codes have the highest capability in error detecting as well as in error correcting. Then, it would be interesting to investigate MDS symbol-triple codes in this constacyclic codes class.

Author Contributions

All authors contributed equally. All authors have read and agreed to the published version of the manuscript.

Funding

This work received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

All data are available and can be provided upon request.

Acknowledgments

The authors sincerely thank the reviewers and the editor for their helpful comments and valuable suggestions, which have greatly improved the presentation of this paper. A part of this paper was written during a stay of H.Q. Dinh in the Vietnam Institute For Advanced Study in Mathematics (VIASM) in Summer 2022, he would like to thank the members of VIASM for their hospitality. This paper is partially supported by the Centre of Excellence in Econometrics, Faculty of Economics, Chiang Mai University, Thailand.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Cassuto, Y.; Blaum, M. Codes for symbol-pair read channels. In Proceedings of the 2010 IEEE International Symposium on Information Theory, Austin, TX, USA, 12–18 June 2010; pp. 988–992. [Google Scholar]
  2. Cassuto, Y.; Blaum, M. Codes for symbol-pair read channels. IEEE Trans. Inf. Theory 2011, 57, 8011–8020. [Google Scholar] [CrossRef]
  3. Yaakobi, E.; Bruck, J.; Siegel, P.H. Constructions and decoding of cyclic codes over b-symbol read channels. IEEE Trans. Inf. Theory 2016, 62, 1541–1551. [Google Scholar] [CrossRef]
  4. Castagnoli, G.; Massey, J.L.; Schoeller, P.A.; Von Seemann, N. On repeated-root cyclic codes. IEEE Trans. Inf. Theory 1991, 37, 337–342. [Google Scholar] [CrossRef] [Green Version]
  5. Van Lint, J.H. Repeated-root cyclic codes. IEEE Trans. Inf. Theory 1991, 37, 343–345. [Google Scholar] [CrossRef] [Green Version]
  6. Gulliver, T.A.; Harada, M. Codes over 𝔽3 + u𝔽3 and improvements to the bounds on ternary linear codes. Des. Codes Cryptogr. 2001, 22, 89–96. [Google Scholar]
  7. Siap, I.; Ray-Chaudhuri, D.K. New linear codes over 𝔽3 and 𝔽5 and improvements on bounds. Des. Codes Cryptogr. 2000, 21, 223–233. [Google Scholar] [CrossRef]
  8. Siap, I.; Ray-Chaudhuri, D.K. New linear codes over 𝔽5 obtained by tripling method and improvements on bounds. IEEE Trans. Inform. Theory 2002, 48, 2764–2768. [Google Scholar] [CrossRef]
  9. Abualrub, T.; Siap, I. Constacyclic codes over 𝔽2 + u𝔽2. J. Franklin Inst. 2009, 346, 520–529. [Google Scholar] [CrossRef]
  10. Amerra, M.C.V.; Nemenzo, F.R. On (1 − u)-cyclic codes over 𝔽pk + u𝔽pk. Appl. Math. Lett. 2008, 21, 1129–1133. [Google Scholar] [CrossRef] [Green Version]
  11. Cao, Y.; Dinh, H.Q.; Fu, F.-W.; Gao, J.; Sriboonchitta, S. Constacyclic codes of length nps over 𝔽pm + u𝔽pm. Adv. Math. Commun. 2018, 12, 231–262. [Google Scholar]
  12. Dinh, H.Q. Constacyclic codes of length ps over 𝔽pm + u𝔽pm. J. Algebra 2010, 324, 940–950. [Google Scholar] [CrossRef] [Green Version]
  13. Dougherty, S.T.; Gaborit, P.; Harada, M.; Solé, P. Type II codes over 𝔽2 + u𝔽2. IEEE Trans. Inform. Theory 1999, 45, 32–45. [Google Scholar] [CrossRef]
  14. Dougherty, S.T.; Kim, J.-L.; Kulosman, H.; Liu, H. Self-dual codes over commutative Frobenius rings. Finite Fields Appl. 2010, 16, 14–26. [Google Scholar] [CrossRef] [Green Version]
  15. Huffman, W.C. On the decompostion of self-dual codes over 𝔽2 + u𝔽2 with an automorphism of odd prime number. Finite Fields Appl. 2007, 13, 682–712. [Google Scholar] [CrossRef] [Green Version]
  16. Laaouine, J. On MDS Symbol-Pair γ-constacyclic codes of length ps over 𝔽pm[u]/〈u2〉. Adv. Dyn. Syst. Appl. 2021, 16, 1811–1826. [Google Scholar]
  17. Laaouine, J.; Charkani, M.E. A note on “H. Q. Dinh et al., Hamming distance of repeated-root constacyclic codes of length 2ps over 𝔽pm + u𝔽pm”. Appl. Algebra Eng. Commun. Comput. 2021, 1–7. [Google Scholar]
  18. Qian, J.F.; Zhang, L.N.; Zhu, S. (1 + u)-constacyclic and cyclic codes over 𝔽2 + u𝔽2. Appl. Math. Lett. 2006, 19, 820–823. [Google Scholar] [CrossRef] [Green Version]
  19. Laaouine, J. On the Hamming and Symbol-Pair Distance of Constacyclic Codes of Length ps over 𝔽pm + u𝔽pm. In Proceedings of the International Conference on Advanced Communication Systems and Information Security, Marrakesh, Morocc, 20–22 November 2019; Springer: Cham, Switzerland, 2019; pp. 137–154. [Google Scholar]
  20. Mostafanasab, H.; Darani, A.Y. On cyclic DNA codes over 𝔽2 + u𝔽2 + u2𝔽2. Commun. Math. Stat. 2021, 9, 39–52. [Google Scholar] [CrossRef]
  21. Laaouine, J.; Charkani, M.E.; Wang, L. Complete classification of repeated-root σ-constacyclic codes of prime power length over 𝔽pm[u]/〈u3〉. Discrete Math. 2021, 344, 112325. [Google Scholar] [CrossRef]
  22. Dinh, H.Q.; Laaouine, J.; Charkani, M.E.; Chinnakum, S. Hamming distance of constacyclic codes of length ps over 𝔽pm + u𝔽pm + u2𝔽pm. IEEE Access 2021, 9, 141064–141078. [Google Scholar] [CrossRef]
  23. Charkani, M.E.; Dinh, H.Q.; Laaouine, J.; Yamaka, W. Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths over 𝔽pm[u]/〈u3〉. Mathematics 2021, 9, 2554. [Google Scholar] [CrossRef]
  24. Huffman, W.C.; Pless, V. Fundamentals of Error-Correcting Codes; Cambridge University Press: Cambridge, UK, 2003. [Google Scholar]
  25. MacWilliams, F.J.; Sloane, N.J.A. The Theory Error-Correcting Codes; Elsevier: Amsterdam, The Netherlands, 1977. [Google Scholar]
  26. Dinh, H.Q.; Satpati, S.; Singh, A.K.; Yamaka, W. Symbol-triple distance of repeated-root constacylic codes of prime power lengths. J. Algebra Appl. 2020, 19, 2050209. [Google Scholar] [CrossRef]
Table 1. Symbol-triple distance of ψ -constacyclic codes over F 7 + u F 7 + u 2 F 7 of Type 2 .
Table 1. Symbol-triple distance of ψ -constacyclic codes over F 7 + u F 7 + u 2 F 7 of Type 2 .
Range of a d st ( C 2 )
a = 0 3
a = 1 4
a = 2 5
3 a 7 6
a = 8 8
9 a 14 9
15 a 21 12
22 a 28 15
29 a 35 18
36 a 42 21
a = 43 28
a = 44 35
a = 45 42
46 a 48 49
Table 2. Symbol-triple distance of ψ -constacyclic codes over F 7 + u F 7 + u 2 F 7 of Type 3 .
Table 2. Symbol-triple distance of ψ -constacyclic codes over F 7 + u F 7 + u 2 F 7 of Type 3 .
Range of A d st ( C 3 )
A = 0 3
A = 1 4
A = 2 5
3 A 7 6
A = 8 8
9 A 14 9
15 A 21 12
22 A 28 15
29 A 35 18
36 A 42 21
A = 43 28
A = 44 35
A = 45 42
46 A 48 49
Table 3. Symbol-triple distance of ψ -constacyclic codes over F 7 + u F 7 + u 2 F 7 of Type 4 .
Table 3. Symbol-triple distance of ψ -constacyclic codes over F 7 + u F 7 + u 2 F 7 of Type 4 .
Range of c d st ( C 4 )
c = 0 3
c = 1 4
c = 2 5
3 c 7 6
c = 8 8
9 c 14 9
15 c 21 12
22 c 28 15
29 c 35 18
36 c 42 21
c = 43 28
c = 44 35
c = 45 42
46 c 47 49
Table 4. Symbol-triple distance of ψ -constacyclic codes over F 7 + u F 7 + u 2 F 7 of Type 5 .
Table 4. Symbol-triple distance of ψ -constacyclic codes over F 7 + u F 7 + u 2 F 7 of Type 5 .
Range of C d st ( C 5 )
C = 1 4
C = 2 5
3 C 7 6
C = 8 8
9 C 14 9
15 C 21 12
22 C 28 15
29 C 35 18
36 C 42 21
C = 43 28
C = 44 35
C = 45 42
46 C 48 49
Table 5. Symbol-triple distance of ψ -constacyclic codes over F 7 + u F 7 + u 2 F 7 of Type 6 .
Table 5. Symbol-triple distance of ψ -constacyclic codes over F 7 + u F 7 + u 2 F 7 of Type 6 .
Range of γ d st ( C 6 )
γ = 0 3
γ = 1 4
γ = 2 5
3 γ 7 6
γ = 8 8
9 γ 14 9
15 γ 21 12
22 γ 28 15
29 γ 35 18
36 γ 42 21
γ = 43 28
γ = 44 35
γ = 45 42
46 γ 47 49
Table 6. Symbol-triple distance of ψ -constacyclic codes over F 7 + u F 7 + u 2 F 7 of Type 7 .
Table 6. Symbol-triple distance of ψ -constacyclic codes over F 7 + u F 7 + u 2 F 7 of Type 7 .
Range of D d st ( C 7 )
D = 0 3
D = 1 4
D = 2 5
3 D 7 6
D = 8 8
9 D 14 9
15 D 21 12
22 D 28 15
29 D 35 18
36 D 42 21
D = 43 28
D = 44 35
D = 45 42
46 D 47 49
Table 7. Symbol-triple distance of ψ -constacyclic codes over F 7 + u F 7 + u 2 F 7 of Type 8 .
Table 7. Symbol-triple distance of ψ -constacyclic codes over F 7 + u F 7 + u 2 F 7 of Type 8 .
Range of γ d st ( C 8 )
γ = 0 3
γ = 1 4
γ = 2 5
3 γ 7 6
γ = 8 8
9 γ 14 9
15 γ 21 12
22 γ 28 15
29 γ 35 18
36 γ 42 21
γ = 43 28
γ = 44 35
γ = 45 42
γ = 46 49
Table 8. ψ -constacyclic codes of length 3 over F 3 + u F 3 + u 2 F 3 .
Table 8. ψ -constacyclic codes of length 3 over F 3 + u F 3 + u 2 F 3 .
Ideal ( C ) d st ( C ) | C |
Type 1  :
0 01
1 319,683
Type 2  :
u 2 327
u 2 ( x ψ ) 39
u 2 ( x ψ ) 2 33
Type 3  :
u 3729
u ( x ψ ) 381
u ( x ψ ) 2 39
u ( x ψ ) + ν 0 u 2 381
u ( x ψ ) 2 + ν 0 u 2 327
u ( x ψ ) 2 + ν 0 u 2 ( x ψ ) 39
Type 4  :
u ( x ψ ) , u 2 3243
u ( x ψ ) 2 , u 2 381
u ( x ψ ) 2 , u 2 ( x ψ ) 327
Type 5  :
( x ψ ) 3729
( x ψ ) 2 327
( x ψ ) + ν 0 u 2 3729
( x ψ ) 2 + ν 0 u 2 381
( x ψ ) 2 + ν 0 u 2 ( x ψ ) 327
( x ψ ) + ν 0 u 3729
( x ψ ) 2 + ν 0 u 3243
( x ψ ) 2 + ν 0 u ( x ψ ) 327
( x ψ ) + ν 0 u + θ 0 u 2 3729
( x ψ ) 2 + ν 0 u + θ 0 u 2 3243
( x ψ ) 2 + ν 0 u ( x ψ ) + θ 0 u 2 + θ 1 u 2 ( x ψ ) 327
( x ψ ) 2 + ν 0 u ( x ψ ) + θ 0 u 2 ( x ψ ) 327
Type 6  :
( x ψ ) , u 2 32187
( x ψ ) 2 , u 2 3243
( x ψ ) 2 , u 2 ( x ψ ) 381
( x ψ ) + ν 0 u , u 2 32187
( x ψ ) 2 + ν 0 u , u 2 3729
( x ψ ) 2 + ν 0 u ( x ψ ) , u 2 3243
( x ψ ) 2 + ν 0 u ( x ψ ) , u 2 ( x ψ ) 381
( x ψ ) 2 + ν 0 u ( x ψ ) + θ 0 u 2 , u 2 ( x ψ ) 381
Type 7  :
( x ψ ) , u 36561
( x ψ ) 2 , u 32187
( x ψ ) 2 , u ( x ψ ) 3243
( x ψ ) 2 , u ( x ψ ) + θ 0 u 2 3243
( x ψ ) 2 + θ 0 u 2 , u ( x ψ ) 3243
( x ψ ) 2 + ν 0 u 2 , u ( x ψ ) + θ 0 u 2 3243
Type 8  :
( x ψ ) 2 , u ( x ψ ) , u 2 3729
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Dinh, H.Q.; Laaouine, J.; Boudine, B.; Yamaka, W. Symbol-Triple Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths over Fq+uFq+u2Fq. Mathematics 2022, 10, 2496. https://doi.org/10.3390/math10142496

AMA Style

Dinh HQ, Laaouine J, Boudine B, Yamaka W. Symbol-Triple Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths over Fq+uFq+u2Fq. Mathematics. 2022; 10(14):2496. https://doi.org/10.3390/math10142496

Chicago/Turabian Style

Dinh, Hai Q., Jamal Laaouine, Brahim Boudine, and Woraphon Yamaka. 2022. "Symbol-Triple Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths over Fq+uFq+u2Fq" Mathematics 10, no. 14: 2496. https://doi.org/10.3390/math10142496

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