May  2020, 14(2): 359-378. doi: 10.3934/amc.2020025

## Repeated-root constacyclic codes of length $3\ell^mp^s$

 1 Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Mathematical Sciences, Anhui University, Hefei, Anhui 230601, China 2 Division of Computational Mathematics and Engineering, Institute for Computational Science, Ton Duc Thang University, Ho Chi Minh City, Vietnam 3 Faculty of Mathematics and Statistics, Ton Duc Thang University, Ho Chi Minh City, Vietnam 4 Centre of Excellence in Econometrics, Faculty of Economics, Chiang Mai University, Chiang Mai 52000, Thailand

* Corresponding author

Received  August 2018 Revised  May 2016 Published  May 2020 Early access  September 2019

Fund Project: This research is supported by National Natural Science Foundation of China (61672036), Excellent Youth Foundation of Natural Science Foundation of Anhui Province (1808085J20) and Academic fund for outstanding talents in universities (gxbjZD03). H. Q. Dinh and S. Sriboonchitta are grateful to the Centre of Excellence in Econometrics, Chiang Mai University, for partial financial support. This research is partially supported by the Research Administration Center, Chaing Mai University

Let $p$ be a prime different from 3, and $\ell$ be an odd prime different from 3 and $p$. In terms of generator polynomials, structures of constacyclic codes and their duals of length $3\ell^mp^s$ over $\mathbb{F}_q$ are established, where $q$ is a power of $p$. We discuss the enumeration of all cyclic codes of length $3\cdot2^s\ell^m$, that generalizes the construction of  (2016), which is the special case of $m = 1$. In addition, as an application, the characterization and enumeration of all linear complementary dual cyclic codes of length $6\ell^mp^s$ over $\mathbb{F}_q$ are obtained.

Citation: Yan Liu, Minjia Shi, Hai Q. Dinh, Songsak Sriboonchitta. Repeated-root constacyclic codes of length $3\ell^mp^s$. Advances in Mathematics of Communications, 2020, 14 (2) : 359-378. doi: 10.3934/amc.2020025
##### References:
  G. K. Bakshi and M. Raka, A class of constacyclic codes over a finite field, Finite Fields Appl., 18 (2012), 362-377.  doi: 10.1016/j.ffa.2011.09.005. Google Scholar  G. K. Bakshi and M. Raka, Self-dual and self-orthogonal negacyclic codes of length $2p^n$ over a finite field, Finite Fields Appl., 19 (2013), 39-54.  doi: 10.1016/j.ffa.2012.10.003. Google Scholar  G. Castagnoli, J. L. Massey, P. A. Schoeller and N. von Seemann, On repeated-root cyclic codes, IEEE Trans. Inf. Theory, 37 (1991), 337-342.  doi: 10.1109/18.75249. Google Scholar  B. C. Chen, H. Q. Dinh and H. W. Liu, Repeated-root constacyclic codes of length $\ell p^s$ and their duals, Discrete Appl. Math., 177 (2014), 60-70.   Google Scholar  H. Q. Dinh, Repeated-root constacyclic codes of length $2\ell^m p^n$, Finite Fields Appl., 18 (2012), 133-143.  doi: 10.1016/j.ffa.2011.07.003. Google Scholar  B. C. Chen, H. W. Liu and G. H. Zhang, A class of minimal cyclic codes over finite fields, Des. Codes Cryptogr., 74 (2015), 285-300.  doi: 10.1007/s10623-013-9857-9. Google Scholar  H. Q. Dinh, Constacyclic codes of length $p^s$ over $\mathbb{F}_{p^m}+u \mathbb{F}_{p^m}$, J. Algebra, 324 (2010), 940-950.  doi: 10.1016/j.jalgebra.2010.05.027. Google Scholar  H. Q. Dinh, On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions, Finite Fields Appl., 14 (2008), 22-40.  doi: 10.1016/j.ffa.2007.07.001. Google Scholar  H. Q. Dinh, Repeated-root constacyclic codes of length $2 p^s$, Finite Fields Appl., 18 (2012), 133-143.  doi: 10.1016/j.ffa.2011.07.003. Google Scholar  H. Q. Dinh, Structure of repeated-root constacyclic codes of length $3 p^s$ and their duals, Discrete Math., 313 (2013), 982-991.  doi: 10.1016/j.disc.2013.01.024. Google Scholar  H. Q. Dinh, Structure of repeated-root cyclic and negacyclic codes of length $6 p^s$ and their duals, Contemp. Math., Amer. Math. Soc., Providence, RI, 609 (2014), 69-87.  doi: 10.1090/conm/609/12150. Google Scholar  H. Q. Dinh, X. Wang, H. Liu and S. Sriboonchitta, Hamming distance of constacyclic codes of length $3p^s$ and optimal codes with respect to the Griesmer and Singleton bound, preprint, 2018. Google Scholar  W. C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes, Cambridge University Press, Cambridge, 2003.  doi: 10.1017/CBO9780511807077. Google Scholar  X. S. Kai and S. X. Zhu, On the distance of cyclic codes length $2^e$ over $\mathbb{Z}_4$, Discrete Math., 310 (2010), 12-20.  doi: 10.1016/j.disc.2009.07.018. Google Scholar  L. Liu, L. Q. Li, X. S. Kai and S. X. Zhu, Repeated-root constacyclic codes of length $3\ell p^s$ and their dual codes, Finite Fields Appl., 42 (2016), 269-295.  doi: 10.1016/j.ffa.2016.08.005. Google Scholar  J. L. Massey, Linear codes with complementary duals, Discrete Math., 106/107 (1992), 337-342.  doi: 10.1016/0012-365X(92)90563-U. Google Scholar  A. Sharma, G. K. Bakshi, V. C. Dumir and M. Raka, Cyclotomic numbers and primitive idempotents in the ring $GF(q)[X]/\langle X^{p^n}-1\rangle$, Finite Fields Appl., 10 (2004), 653-673.  doi: 10.1016/j.ffa.2004.01.005. Google Scholar  H. X. Tong, Repeated-root constacyclic codes of length $k\ell^ap^b$ over a finite field, Finite Fields Appl., 41 (2016), 159-173.  doi: 10.1016/j.ffa.2016.06.006. Google Scholar  J. H. van Lint, Repeated-root cyclic codes, IEEE Trans. Inf. Theory, 37 (1991), 343-345.  doi: 10.1109/18.75250. Google Scholar  Z. X. Wan, Lectures on Finite Fields and Galois Rings, World Scientific Publishing Co., Inc., River Edge, NJ, 2003. doi: 10.1142/5350. Google Scholar  S. D. Yang, X. L. Kong and C. M. Tang, A construction of linear codes and their complete weight enumerators, Finite Fields and Their Applications, 48 (2017), 196-226.  doi: 10.1016/j.ffa.2017.08.001. Google Scholar  S. D. Yang, Z. A. Yao and C. A. Zhao, The weight enumerator of the duals of a class of cyclic codes with three zeros, Applicable Algebra in Engineering, Communication and Computing, 26 (2015), 347-367.  doi: 10.1007/s00200-015-0255-6. Google Scholar  S. D. Yang, Z. A. Yao and C. A. Zhao, The weight distributions of two classes of $p$-ary cyclic codes with few weights, Finite Fields and Their Applications, 44 (2017), 76-91.  doi: 10.1016/j.ffa.2016.11.004. Google Scholar  S. D. Yang and Z. A. Yao, Complete weight enumerators of a class of linear codes, Discrete Mathematics, 340 (2017), 729-739.  doi: 10.1016/j.disc.2016.11.029. Google Scholar

show all references

##### References:
  G. K. Bakshi and M. Raka, A class of constacyclic codes over a finite field, Finite Fields Appl., 18 (2012), 362-377.  doi: 10.1016/j.ffa.2011.09.005. Google Scholar  G. K. Bakshi and M. Raka, Self-dual and self-orthogonal negacyclic codes of length $2p^n$ over a finite field, Finite Fields Appl., 19 (2013), 39-54.  doi: 10.1016/j.ffa.2012.10.003. Google Scholar  G. Castagnoli, J. L. Massey, P. A. Schoeller and N. von Seemann, On repeated-root cyclic codes, IEEE Trans. Inf. Theory, 37 (1991), 337-342.  doi: 10.1109/18.75249. Google Scholar  B. C. Chen, H. Q. Dinh and H. W. Liu, Repeated-root constacyclic codes of length $\ell p^s$ and their duals, Discrete Appl. Math., 177 (2014), 60-70.   Google Scholar  H. Q. Dinh, Repeated-root constacyclic codes of length $2\ell^m p^n$, Finite Fields Appl., 18 (2012), 133-143.  doi: 10.1016/j.ffa.2011.07.003. Google Scholar  B. C. Chen, H. W. Liu and G. H. Zhang, A class of minimal cyclic codes over finite fields, Des. Codes Cryptogr., 74 (2015), 285-300.  doi: 10.1007/s10623-013-9857-9. Google Scholar  H. Q. Dinh, Constacyclic codes of length $p^s$ over $\mathbb{F}_{p^m}+u \mathbb{F}_{p^m}$, J. Algebra, 324 (2010), 940-950.  doi: 10.1016/j.jalgebra.2010.05.027. Google Scholar  H. Q. Dinh, On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions, Finite Fields Appl., 14 (2008), 22-40.  doi: 10.1016/j.ffa.2007.07.001. Google Scholar  H. Q. Dinh, Repeated-root constacyclic codes of length $2 p^s$, Finite Fields Appl., 18 (2012), 133-143.  doi: 10.1016/j.ffa.2011.07.003. Google Scholar  H. Q. Dinh, Structure of repeated-root constacyclic codes of length $3 p^s$ and their duals, Discrete Math., 313 (2013), 982-991.  doi: 10.1016/j.disc.2013.01.024. Google Scholar  H. Q. Dinh, Structure of repeated-root cyclic and negacyclic codes of length $6 p^s$ and their duals, Contemp. Math., Amer. Math. Soc., Providence, RI, 609 (2014), 69-87.  doi: 10.1090/conm/609/12150. Google Scholar  H. Q. Dinh, X. Wang, H. Liu and S. Sriboonchitta, Hamming distance of constacyclic codes of length $3p^s$ and optimal codes with respect to the Griesmer and Singleton bound, preprint, 2018. Google Scholar  W. C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes, Cambridge University Press, Cambridge, 2003.  doi: 10.1017/CBO9780511807077. Google Scholar  X. S. Kai and S. X. Zhu, On the distance of cyclic codes length $2^e$ over $\mathbb{Z}_4$, Discrete Math., 310 (2010), 12-20.  doi: 10.1016/j.disc.2009.07.018. Google Scholar  L. Liu, L. Q. Li, X. S. Kai and S. X. Zhu, Repeated-root constacyclic codes of length $3\ell p^s$ and their dual codes, Finite Fields Appl., 42 (2016), 269-295.  doi: 10.1016/j.ffa.2016.08.005. Google Scholar  J. L. Massey, Linear codes with complementary duals, Discrete Math., 106/107 (1992), 337-342.  doi: 10.1016/0012-365X(92)90563-U. Google Scholar  A. Sharma, G. K. Bakshi, V. C. Dumir and M. Raka, Cyclotomic numbers and primitive idempotents in the ring $GF(q)[X]/\langle X^{p^n}-1\rangle$, Finite Fields Appl., 10 (2004), 653-673.  doi: 10.1016/j.ffa.2004.01.005. Google Scholar  H. X. Tong, Repeated-root constacyclic codes of length $k\ell^ap^b$ over a finite field, Finite Fields Appl., 41 (2016), 159-173.  doi: 10.1016/j.ffa.2016.06.006. Google Scholar  J. H. van Lint, Repeated-root cyclic codes, IEEE Trans. Inf. Theory, 37 (1991), 343-345.  doi: 10.1109/18.75250. Google Scholar  Z. X. Wan, Lectures on Finite Fields and Galois Rings, World Scientific Publishing Co., Inc., River Edge, NJ, 2003. doi: 10.1142/5350. Google Scholar  S. D. Yang, X. L. Kong and C. M. Tang, A construction of linear codes and their complete weight enumerators, Finite Fields and Their Applications, 48 (2017), 196-226.  doi: 10.1016/j.ffa.2017.08.001. Google Scholar  S. D. Yang, Z. A. Yao and C. A. Zhao, The weight enumerator of the duals of a class of cyclic codes with three zeros, Applicable Algebra in Engineering, Communication and Computing, 26 (2015), 347-367.  doi: 10.1007/s00200-015-0255-6. Google Scholar  S. D. Yang, Z. A. Yao and C. A. Zhao, The weight distributions of two classes of $p$-ary cyclic codes with few weights, Finite Fields and Their Applications, 44 (2017), 76-91.  doi: 10.1016/j.ffa.2016.11.004. Google Scholar  S. D. Yang and Z. A. Yao, Complete weight enumerators of a class of linear codes, Discrete Mathematics, 340 (2017), 729-739.  doi: 10.1016/j.disc.2016.11.029. Google Scholar
  Ranya Djihad Boulanouar, Aicha Batoul, Delphine Boucher. An overview on skew constacyclic codes and their subclass of LCD codes. Advances in Mathematics of Communications, 2021, 15 (4) : 611-632. doi: 10.3934/amc.2020085  Alexis Eduardo Almendras Valdebenito, Andrea Luigi Tironi. On the dual codes of skew constacyclic codes. Advances in Mathematics of Communications, 2018, 12 (4) : 659-679. doi: 10.3934/amc.2018039  Cem Güneri, Ferruh Özbudak, Funda ÖzdemIr. On complementary dual additive cyclic codes. Advances in Mathematics of Communications, 2017, 11 (2) : 353-357. doi: 10.3934/amc.2017028  Minjia Shi, Daitao Huang, Lin Sok, Patrick Solé. Double circulant self-dual and LCD codes over Galois rings. Advances in Mathematics of Communications, 2019, 13 (1) : 171-183. doi: 10.3934/amc.2019011  Fengwei Li, Qin Yue, Fengmei Liu. The weight distributions of constacyclic codes. Advances in Mathematics of Communications, 2017, 11 (3) : 471-480. doi: 10.3934/amc.2017039  Xinmei Huang, Qin Yue, Yansheng Wu, Xiaoping Shi. Ternary Primitive LCD BCH codes. Advances in Mathematics of Communications, 2021  doi: 10.3934/amc.2021014  Ram Krishna Verma, Om Prakash, Ashutosh Singh, Habibul Islam. New quantum codes from skew constacyclic codes. Advances in Mathematics of Communications, 2021  doi: 10.3934/amc.2021028  Haode Yan, Hao Liu, Chengju Li, Shudi Yang. Parameters of LCD BCH codes with two lengths. Advances in Mathematics of Communications, 2018, 12 (3) : 579-594. doi: 10.3934/amc.2018034  Habibul Islam, Om Prakash, Patrick Solé. $\mathbb{Z}_{4}\mathbb{Z}_{4}[u]$-additive cyclic and constacyclic codes. Advances in Mathematics of Communications, 2021, 15 (4) : 737-755. doi: 10.3934/amc.2020094  Ekkasit Sangwisut, Somphong Jitman, Patanee Udomkavanich. Constacyclic and quasi-twisted Hermitian self-dual codes over finite fields. Advances in Mathematics of Communications, 2017, 11 (3) : 595-613. doi: 10.3934/amc.2017045  Nabil Bennenni, Kenza Guenda, Sihem Mesnager. DNA cyclic codes over rings. Advances in Mathematics of Communications, 2017, 11 (1) : 83-98. doi: 10.3934/amc.2017004  Heide Gluesing-Luerssen, Katherine Morrison, Carolyn Troha. Cyclic orbit codes and stabilizer subfields. Advances in Mathematics of Communications, 2015, 9 (2) : 177-197. doi: 10.3934/amc.2015.9.177  Aicha Batoul, Kenza Guenda, T. Aaron Gulliver. Some constacyclic codes over finite chain rings. Advances in Mathematics of Communications, 2016, 10 (4) : 683-694. doi: 10.3934/amc.2016034  Somphong Jitman, San Ling, Patanee Udomkavanich. Skew constacyclic codes over finite chain rings. Advances in Mathematics of Communications, 2012, 6 (1) : 39-63. doi: 10.3934/amc.2012.6.39  Anuradha Sharma, Saroj Rani. Trace description and Hamming weights of irreducible constacyclic codes. Advances in Mathematics of Communications, 2018, 12 (1) : 123-141. doi: 10.3934/amc.2018008  Delphine Boucher, Patrick Solé, Felix Ulmer. Skew constacyclic codes over Galois rings. Advances in Mathematics of Communications, 2008, 2 (3) : 273-292. doi: 10.3934/amc.2008.2.273  Gabriele Nebe, Wolfgang Willems. On self-dual MRD codes. Advances in Mathematics of Communications, 2016, 10 (3) : 633-642. doi: 10.3934/amc.2016031  Sergio R. López-Permouth, Benigno R. Parra-Avila, Steve Szabo. Dual generalizations of the concept of cyclicity of codes. Advances in Mathematics of Communications, 2009, 3 (3) : 227-234. doi: 10.3934/amc.2009.3.227  Somphong Jitman, San Ling, Ekkasit Sangwisut. On self-dual cyclic codes of length $p^a$ over $GR(p^2,s)$. Advances in Mathematics of Communications, 2016, 10 (2) : 255-273. doi: 10.3934/amc.2016004  Nuh Aydin, Nicholas Connolly, Markus Grassl. Some results on the structure of constacyclic codes and new linear codes over GF(7) from quasi-twisted codes. Advances in Mathematics of Communications, 2017, 11 (1) : 245-258. doi: 10.3934/amc.2017016

2020 Impact Factor: 0.935
{"ft_lang_label":"__label__en","ft_lang_prob":0.5313585,"math_prob":0.68190736,"size":14452,"snap":"2021-43-2021-49","text_gpt3_token_len":5110,"char_repetition_ratio":0.1985742,"word_repetition_ratio":0.6938967,"special_character_ratio":0.4030584,"punctuation_ratio":0.28859252,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9728779,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-11-29T15:38:55Z\",\"WARC-Record-ID\":\"<urn:uuid:0cd7bc52-9201-46b6-bb97-0bfc6900f380>\",\"Content-Length\":\"121565\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5373b544-76e7-453f-801a-05d3e03087d3>\",\"WARC-Concurrent-To\":\"<urn:uuid:ffdb172c-219c-4e31-aa87-7d46bf2a0b57>\",\"WARC-IP-Address\":\"107.161.80.18\",\"WARC-Target-URI\":\"https://www.aimsciences.org/article/doi/10.3934/amc.2020025\",\"WARC-Payload-Digest\":\"sha1:VAGC3JHE2ZWHBFLEMEOGPAH7PCXY7VUA\",\"WARC-Block-Digest\":\"sha1:C6CAI2UXBD34FNAXRMDXA5KJE6LBJMTX\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964358774.44_warc_CC-MAIN-20211129134323-20211129164323-00273.warc.gz\"}"}