Abstract
Let p be an odd prime, where and m are positive integers. Let be a nonzero element of the finite field , where , and . In this paper, we determine completely the symbol-triple distances of all -constacyclic codes of length over .
MSC:
94B15; 11T71
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, , 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 , 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 is the Hamming weight of , denoted by . Let and be two codewords, and their Hamming distance denoted by is the number of their components which differ.
A codeword is represented in symbol-triple read channels as
The Hamming weight of the symbol-triple vector is called the symbol-triple weight of the vector :
For two vectors and in , the symbol-triple distance between them is:
Then, for a code C, the symbol-triple distance is defined as
For a linear code C, the symbol-triple distance and symbol-triple weight are coincided. They are defined as:
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 . If n is divisible by the characteristic p of R, then we obtain the so-called repeated-root codes.
Let be a finite field of elements, where p is a prime, m is a positive integer and let be an integer. Then, the ring is a finite commutative chain ring. Many authors [6,7,8] studied algebraic structures of constacyclic codes over R:
For , 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 , 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 over for a nonzero element of 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 over . 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, is the field of order q with where p is a prime positive integer, m is a positive integer, and we denote
is a finite chain ring, is its maximal ideal, and its invertible elements in are of the form: where and .
Linear codes of length n over are defined as -submodules of . For a unit in , -constacyclic codes of length n over are the linear codes of length n over , which satisfy the following property: implies that . Then, in order to study them, it suffices to study ideals of the ring (cf. [24,25]).
So, for a unit of , -constacyclic codes of length over are exactly the ideals of
In [21], Laaouine et al. classified and determined their structure:
Theorem 1
where .
where , , either is 0 or is a unit in . Here, is the smallest integer such that .
where , , either is 0 or is a unit in , and is the same as in .
where , , and are 0 or are units in . Here, being the smallest integer such that , for some and is the smallest integer satisfying .
where , , and are 0 or are units in . Here, , are the same as in .
where , , , and are 0 or are units in . Here, is the smallest integer such that and is the same as in .
where , , , and are 0 or are units in . Here, as in and is the same as in .
(cf. [21]). The ring is local finite non-chain ring, its maximal ideal is , where such that . ψ-constacyclic codes of length over (i.e., ideals of the ring ) are
Proposition 1
(cf. [21]). We have
3. Symbol-Triple Distance
This section will be devoted to determining the symbol-triple distances of all types of -constacyclic codes of length over . Therefore, we recall the following result.
Theorem 2
(cf. [26]). Let be a ψ-constacyclic code of length over . Then, , , and its symbol-triple distance is determined by:
For a code over , the symbol-triple distance is denoted by .
Now, for each type of -constacyclic codes of length over , we compute the symbol-triple distance one by one.
consists only of the trivial ideals , . Hence, they have symbol-triple distances of 0 and 3, respectively.
The codewords of a code of with are exactly those of the -constacyclic codes in multiplied by . Thus, we obtain and Theorem 2 gives it.
Theorem 3.
For a ψ-constacyclic code , of . The symbol-triple distance is given by
Now, we are going to calculate the symbol-triple distances of codes of , , , , and . To do this, notice that
where .
The symbol-triple distance -constacyclic codes of can be calculated by the next theorem:
Theorem 4.
Let be of . The symbol-triple distance of is given by
Proof.
Let be an arbitrary nonzero element of . That means that there exists
- verifying
Thus,
By (1), we obtain that
Since , we have
It follows that for any nonzero element of . Then,
Moreover, we have
it follows that
This proves the theorem. □
Now, let us show the symbol-triple distance for .
Theorem 5.
For ψ-constacyclic code of , the symbol-triple distance is given by
Proof.
At first, since , we obtain
To prove that , let , we should prove that
By (1), we obtain that
Hence, , forcing
This proves the theorem. □
Now, we calculate the symbol-triple distance for :
Theorem 6.
For a ψ-constacyclic code of , the symbol-triple distance is given by
Proof.
Let be of . Now, for each nonzero , there exist such that
Thus,
By (1), we see that
The fact that follows that
This implies that .
Moreover, we have that
then and we obtain
This proves the theorem. □
The symbol-triple distance for can be established by the next theorem:
Theorem 7.
For a ψ-constacyclic codeof, the symbol-triple distanceis given by
Proof.
At first, since , we obtain
Now, let . Thus, by (1), we find that
Hence, , forcing
This proves the theorem. □
Now, we show the symbol-triple distance for .
Theorem 8.
For a ψ-constacyclic code of , the symbol-triple distance is given by
Proof.
At first, since , we obtain
Now, let . Then, we distinguish two different cases.
: if , then by (1), we obtain
: if , then by (1), we obtain
We have , then, we obtain
Therefore, , forcing
This completes the proof. □
Finally, we give the symbol-triple distance for .
Theorem 9.
For a ψ-constacyclic code of , the symbol-triple distance is given by
4. Examples
This section is devoted to show some examples of symbol-triple distances of constacyclic codes of length over .
Example 1.
Consider the ring , with , and . There are eight types of generators of ψ-constacyclic codes of length 49 over . Then, for each type of generator, we give the symbol-triple distances:
- ▹
- : , ,
- ▹
- : , ; then, the symbol-triple distance, , is presented in Table 1.
Table 1. Symbol-triple distance of -constacyclic codes over of . - ▹
- : , where is 0 or is a unit in , , , and then the symbol-triple distance, , is presented in Table 2.
Table 2. Symbol-triple distance of -constacyclic codes over of . - ▹
- : , where is a unit in or 0, , , then, the symbol-triple distance, , is presented in Table 3.
Table 3. Symbol-triple distance of -constacyclic codes over of . - ▹
- : , where are 0 or are units in , , , . Then, the symbol-triple distance, , is presented in Table 4.
Table 4. Symbol-triple distance of -constacyclic codes over of . - ▹
- : , where are 0 or are units in , , , , then, the symbol-triple distance, , is presented in Table 5.
Table 5. Symbol-triple distance of -constacyclic codes over of . - ▹
- : , where are 0 or are units in , , , , . Then, the symbol-triple distance, , is presented in Table 6.
Table 6. Symbol-triple distance of -constacyclic codes over of . - ▹
- : , where are 0 or are units in , , , , , then, the symbol-triple distance, , is presented in Table 7.
Table 7. Symbol-triple distance of -constacyclic codes over of .
Example 2.
Table 8 presents all ψ-constacyclic codes of length 3 over , where , with their symbol-triple distances and their number of codewords . In all codes, we have and .
Table 8.
-constacyclic codes of length 3 over .
5. Conclusions
In this research article, we determined all symbol-triple distances of -constacyclic codes of length over , where , , and . 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
- 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]
- Cassuto, Y.; Blaum, M. Codes for symbol-pair read channels. IEEE Trans. Inf. Theory 2011, 57, 8011–8020. [Google Scholar] [CrossRef]
- 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]
- 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]
- Van Lint, J.H. Repeated-root cyclic codes. IEEE Trans. Inf. Theory 1991, 37, 343–345. [Google Scholar] [CrossRef] [Green Version]
- 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]
- 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]
- 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]
- Abualrub, T.; Siap, I. Constacyclic codes over 𝔽2 + u𝔽2. J. Franklin Inst. 2009, 346, 520–529. [Google Scholar] [CrossRef]
- 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]
- 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]
- Dinh, H.Q. Constacyclic codes of length ps over 𝔽pm + u𝔽pm. J. Algebra 2010, 324, 940–950. [Google Scholar] [CrossRef] [Green Version]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- Huffman, W.C.; Pless, V. Fundamentals of Error-Correcting Codes; Cambridge University Press: Cambridge, UK, 2003. [Google Scholar]
- MacWilliams, F.J.; Sloane, N.J.A. The Theory Error-Correcting Codes; Elsevier: Amsterdam, The Netherlands, 1977. [Google Scholar]
- 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]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).