{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T08:27:35Z","timestamp":1765268855045,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T00:00:00Z","timestamp":1651708800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T00:00:00Z","timestamp":1651708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s12190-022-01738-7","type":"journal-article","created":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T15:46:48Z","timestamp":1651765608000},"page":"219-250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["MDS symbol-pair repeated-root constacylic codes of prime power lengths over $$\\mathbb {F}_{q}+ u\\mathbb {F}_{q} + u^{2}\\mathbb {F}_{q} $$"],"prefix":"10.1007","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8623-6094","authenticated-orcid":false,"given":"Jamal","family":"Laaouine","sequence":"first","affiliation":[]},{"given":"Hai Q.","family":"Dinh","sequence":"additional","affiliation":[]},{"given":"Mohammed E.","family":"Charkani","sequence":"additional","affiliation":[]},{"given":"Woraphon","family":"Yamaka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,5]]},"reference":[{"issue":"5","key":"1738_CR1","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1016\/j.jfranklin.2009.02.001","volume":"346","author":"T Abualrub","year":"2009","unstructured":"Abualrub, T., Siap, I.: Constacyclic codes over $$\\mathbb{F}_2+u\\mathbb{F}_2$$. J. Franklin Inst. 346(5), 520\u2013529 (2009)","journal-title":"J. Franklin Inst."},{"issue":"11","key":"1738_CR2","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1016\/j.aml.2007.07.035","volume":"21","author":"MCV Amarra","year":"2008","unstructured":"Amarra, M.C.V., Nemenzo, F.R.: On $$(1-u)$$-cyclic codes over $$\\mathbb{F} _{p^k}+u\\mathbb{F}_{p^k}$$. Appl. Math. Lett. 21(11), 1129\u20131133 (2008)","journal-title":"Appl. Math. Lett."},{"issue":"2","key":"1738_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.3934\/amc.2018016","volume":"12","author":"Y Cao","year":"2018","unstructured":"Cao, Y., Cao, Y., Dinh, H.Q., Fu, F.W., Gao, J., Sriboonchitta, S.: Constacyclic codes of length $$np^s$$ over $$\\mathbb{F} _{p^m} + u\\mathbb{F} _{p^m}$$. Adv. Math. Commun. 12(2), 231\u2013262 (2018)","journal-title":"Adv. Math. Commun."},{"key":"1738_CR4","doi-asserted-by":"crossref","unstructured":"Cassuto, Y., Blaum, M.: Codes for symbol-pair read channels. In Proceedings of IEEE International Symposium on Information Theory, pp. 988\u2013992 (2010)","DOI":"10.1109\/ISIT.2010.5513753"},{"issue":"12","key":"1738_CR5","doi-asserted-by":"publisher","first-page":"8011","DOI":"10.1109\/TIT.2011.2164891","volume":"57","author":"Y Cassuto","year":"2011","unstructured":"Cassuto, Y., Blaum, M.: Codes for symbol-pair read channels. IEEE Trans. Inf. Theory 57(12), 8011\u20138020 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1738_CR6","doi-asserted-by":"crossref","unstructured":"Cassuto, Y., Litsyn, S.: Symbol-pair codes: algebraic constructions and asymptotic bounds. In Proceedings of IEEE International Symposium on Information Theory, pp. 2348\u20132352 (2011)","DOI":"10.1109\/ISIT.2011.6033982"},{"issue":"2","key":"1738_CR7","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/18.75249","volume":"37","author":"G Castagnoli","year":"1991","unstructured":"Castagnoli, G., Massey, J.L., Schoeller, P.A., Seemann, N.V.: On repeated-root cyclic codes. IEEE Trans. Inf. Theory 37(2), 337\u2013342 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"20","key":"1738_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/math9202554","volume":"9","author":"ME Charkani","year":"2021","unstructured":"Charkani, M.E., Dinh, H.Q., Laaouine, J., Yamaka, W.: Symbol-pair distance of repeated-root constacyclic codes of prime power lengths over $${\\mathbb{F}_{p^m}[u]}\/{\\langle u^3\\rangle }$$. Mathematics 9(20), 1\u201315 (2021)","journal-title":"Mathematics"},{"issue":"11","key":"1738_CR9","doi-asserted-by":"publisher","first-page":"7259","DOI":"10.1109\/TIT.2013.2276615","volume":"59","author":"YM Chee","year":"2013","unstructured":"Chee, Y.M., Ji, L., Kiah, H.M., Wang, C., Yin, J.: Maximum distance separable codes for symbol-pair read channels. IEEE Trans. Inf. Theory 59(11), 7259\u20137267 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1738_CR10","doi-asserted-by":"publisher","first-page":"7661","DOI":"10.1109\/TIT.2017.2753250","volume":"63","author":"B Chen","year":"2017","unstructured":"Chen, B., Lin, L., Liu, H.: Constacyclic symbol-pair codes: lower bounds and optimal constructions. IEEE Trans. Inf. Theory 63(12), 7661\u20137666 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1738_CR11","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1007\/s10623-017-0365-1","volume":"86","author":"B Ding","year":"2018","unstructured":"Ding, B., Ge, G., Zhang, J., Zhang, T., Zhang, Y.: New constructions of MDS symbol-pair codes. Des. Codes Cryptogr. 86(4), 841\u2013859 (2018)","journal-title":"Des. Codes Cryptogr."},{"key":"1738_CR12","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.ffa.2017.10.002","volume":"49","author":"B Ding","year":"2018","unstructured":"Ding, B., Zhang, T., Ge, G.: Maximum distance separable codes for $$b$$-symbol read channels. Finite Fields Appl. 49, 180\u2013197 (2018)","journal-title":"Finite Fields Appl."},{"issue":"4","key":"1738_CR13","doi-asserted-by":"publisher","first-page":"1730","DOI":"10.1109\/TIT.2009.2013015","volume":"55","author":"HQ Dinh","year":"2009","unstructured":"Dinh, H.Q.: Constacyclic codes of length $$2^s$$ over Galois extension rings of $$\\mathbb{F}_2+u\\mathbb{F}_2$$. IEEE Trans. Inform. Theory 55(4), 1730\u20131740 (2009)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1738_CR14","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1016\/j.jalgebra.2010.05.027","volume":"324","author":"HQ Dinh","year":"2010","unstructured":"Dinh, H.Q.: Constacyclic codes of length $$p^s$$ over $$\\mathbb{F}_{p^m}+u \\mathbb{F}_{p^m}$$. J. Algebra 324, 940\u2013950 (2010)","journal-title":"J. Algebra"},{"key":"1738_CR15","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.ffa.2014.09.003","volume":"31","author":"HQ Dinh","year":"2015","unstructured":"Dinh, H.Q., Wang, L., Zhu, S.: Negacyclic codes of length $$2p^s$$ over $$\\mathbb{F}_{p^m}+u\\mathbb{F}_{p^m}$$. Finite Fields Appl. 31, 178\u2013201 (2015)","journal-title":"Finite Fields Appl."},{"issue":"4","key":"1738_CR16","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1016\/j.disc.2016.11.014","volume":"340","author":"HQ Dinh","year":"2017","unstructured":"Dinh, H.Q., Dhompongsa, S., Sriboonchitta, S.: On constacyclic codes of length $$4p^s$$ over $$\\mathbb{F}_{p^m}+u \\mathbb{F}_{p^m}$$. Discrete Math. 340(4), 832\u2013849 (2017)","journal-title":"Discrete Math."},{"key":"1738_CR17","doi-asserted-by":"publisher","first-page":"1728","DOI":"10.1109\/TIT.2004.831789","volume":"50","author":"HQ Dinh","year":"2004","unstructured":"Dinh, H.Q., L\u00f3pez-Permouth, S.R.: Cyclic and negacyclic codes over finite chain rings. IEEE Trans. Inform. Theory 50, 1728\u20131744 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1738_CR18","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ffa.2016.09.004","volume":"43","author":"HQ Dinh","year":"2017","unstructured":"Dinh, H.Q., Liu, H., Liu, X.S., Sriboonchitta, S.: On structure and distances of some classes of repeated-root constacyclic codes over Galois rings. Finite Fields Appl. 43, 86\u2013105 (2017)","journal-title":"Finite Fields Appl."},{"issue":"4","key":"1738_CR19","doi-asserted-by":"publisher","first-page":"2417","DOI":"10.1109\/TIT.2017.2726691","volume":"64","author":"HQ Dinh","year":"2018","unstructured":"Dinh, H.Q., Nguyen, B.T., Singh, A.K., Sriboonchitta, S.: On the symbol-pair distance of repeated-root constacyclic codes of prime power lengths. IEEE Trans. Inf. Theory 64(4), 2417\u20132430 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1738_CR20","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ffa.2016.07.011","volume":"43","author":"HQ Dinh","year":"2017","unstructured":"Dinh, H.Q., Nguyen, H.D., Sriboonchitta, S.: Repeated-root constacyclic codes of prime power lengths over finite chain rings. Finite Fields Appl. 43, 22\u201341 (2017)","journal-title":"Finite Fields Appl."},{"issue":"12","key":"1738_CR21","doi-asserted-by":"publisher","first-page":"2400","DOI":"10.1109\/LCOMM.2018.2868637","volume":"22","author":"HQ Dinh","year":"2018","unstructured":"Dinh, H.Q., Nguyen, B.T., Singh, A.K., Sriboonchitta, S.: Hamming and symbol-pair distances of repeated-root constacyclic codes of prime power lengths over $$\\mathbb{F}_{p^m}+u \\mathbb{F}_{p^m}$$. IEEE Commun. Lett. 22(12), 2400\u20132403 (2018)","journal-title":"IEEE Commun. Lett."},{"key":"1738_CR22","doi-asserted-by":"publisher","first-page":"141064","DOI":"10.1109\/ACCESS.2021.3117658","volume":"9","author":"HQ Dinh","year":"2021","unstructured":"Dinh, H.Q., Laaouine, J., Charkani, M.E., Chinnakum, W.: Hamming distance of constacyclic codes of length $$ p^s $$ over $$\\mathbb{F}_{p^m}+u \\mathbb{F}_{p^m}+u^2 \\mathbb{F}_{p^m}$$. IEEE Access 9, 141064\u2013141078 (2021)","journal-title":"IEEE Access"},{"issue":"1","key":"1738_CR23","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/18.746770","volume":"45","author":"ST Dougherty","year":"1999","unstructured":"Dougherty, S.T., Gaborit, P., Harada, M., Sol\u00e9, P.: Type II codes over $$\\mathbb{F}_2+u\\mathbb{F}_2$$. IEEE Trans. Inform. Theory 45(1), 32\u201345 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"1738_CR24","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ffa.2009.11.004","volume":"16","author":"ST Dougherty","year":"2010","unstructured":"Dougherty, S.T., Kim, J.L., Kulosman, H., Liu, H.: Self-dual codes over commutative Frobenius rings. Finite Fields Appl. 16(1), 14\u201326 (2010)","journal-title":"Finite Fields Appl."},{"issue":"1","key":"1738_CR25","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1023\/A:1020834531372","volume":"16","author":"ST Dougherty","year":"2002","unstructured":"Dougherty, S.T., Skriganov, M.M.: Maximum distance separable codes in the $$ \\rho $$ metric over arbitrary alphabets. J. Algebr. Comb. 16(1), 71\u201381 (2002)","journal-title":"J. Algebr. Comb."},{"issue":"1","key":"1738_CR26","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/A:1008355310919","volume":"22","author":"TA Gulliver","year":"2001","unstructured":"Gulliver, T.A., Harada, M.: Codes over $$\\mathbb{F}_3+u\\mathbb{F}_3$$ and improvements to the bounds on ternary linear codes. Des. Codes Cryptogr. 22(1), 89\u201396 (2001)","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"1738_CR27","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1016\/j.ffa.2006.02.003","volume":"13","author":"WC Huffman","year":"2007","unstructured":"Huffman, W.C.: On the decompostion of self-dual codes over $$\\mathbb{F}_2+u\\mathbb{F}_2$$ with an automorphism of odd prime order. Finite Fields Their Appl. 13(3), 681\u2013712 (2007)","journal-title":"Finite Fields Their Appl."},{"key":"1738_CR28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)"},{"issue":"11","key":"1738_CR29","doi-asserted-by":"publisher","first-page":"5828","DOI":"10.1109\/TIT.2015.2481889","volume":"61","author":"X Kai","year":"2015","unstructured":"Kai, X., Zhu, S., Li, P.: A construction of new MDS symbol-pair codes. IEEE Trans. Inf. Theory 61(11), 5828\u20135834 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1738_CR30","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/LCOMM.2018.2791422","volume":"22","author":"X Kai","year":"2018","unstructured":"Kai, X., Zhu, S., Zhao, Y., Luo, H., Chen, Z.: New MDS symbol-pair codes from repeated-root codes. IEEE Commun. Lett. 22(3), 462\u2013465 (2018)","journal-title":"IEEE Commun. Lett."},{"key":"1738_CR31","doi-asserted-by":"crossref","unstructured":"Laaouine, J.: On the hamming and symbol-pair distance of constacyclic codes of length $$p^s $$ over$$\\mathbb{F}_{p^ m}+ u\\mathbb{F}_ {p^ m}$$. In International Conference on Advanced Communication Systems and Information Security. pp. 137\u2013154. Springer, Cham (2019)","DOI":"10.1007\/978-3-030-61143-9_12"},{"issue":"2","key":"1738_CR32","first-page":"1811","volume":"16","author":"J Laaouine","year":"2021","unstructured":"Laaouine, J.: On MDS symbol-pair $$ \\gamma $$-constacyclic codes of length $$ p^s $$ over $${\\mathbb{F}_{p^m}[u]}\/{\\langle u^2\\rangle }$$. Adv. Dyn. Syst. Appl. 16(2), 1811\u20131826 (2021)","journal-title":"Adv. Dyn. Syst. Appl."},{"key":"1738_CR33","doi-asserted-by":"crossref","unstructured":"Laaouine, J., Charkani, M. E.: A note on\u201cH. Q. Dinh et al., Hamming distance of repeated-root constacyclic codes of length $$ 2 p^{s}$$ over $${\\mathbb{F}}_{p^{m}}+ u {\\mathbb{F}}_{p^{m}}$$\u201d. Applicable Algebra in Engineering, Communication and Computing, pp. 1\u20137, (2021)","DOI":"10.1007\/s00200-021-00492-w"},{"issue":"6","key":"1738_CR34","doi-asserted-by":"publisher","first-page":"112325","DOI":"10.1016\/j.disc.2021.112325","volume":"344","author":"J Laaouine","year":"2021","unstructured":"Laaouine, J., Charkani, M.E., Wang, L.: Complete classification of repeated-root $$\\sigma $$-constacyclic codes of prime power length over $${\\mathbb{F}_{p^m}[u]}\/{\\langle u^3\\rangle }$$. Discrete Math. 344(6), 112325 (2021)","journal-title":"Discrete Math."},{"issue":"3","key":"1738_CR35","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10623-016-0271-y","volume":"84","author":"S Li","year":"2017","unstructured":"Li, S., Ge, G.: Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes. Des. Codes Cryptogr. 84(3), 359\u2013372 (2017)","journal-title":"Des. Codes Cryptogr."},{"key":"1738_CR36","volume-title":"The Theory Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory Error-Correcting Codes. Elsevier, Amsterdam (1977)"},{"issue":"1","key":"1738_CR37","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s40304-019-00188-1","volume":"9","author":"H Mostafanasab","year":"2021","unstructured":"Mostafanasab, H., Yousefian Darani, A.: On cyclic DNA codes over $$\\mathbb{F}_{2} +u\\mathbb{F}_{2}+u^2 \\mathbb{F}_{2}$$. Commun. Math. Stat. 9(1), 39\u201352 (2021)","journal-title":"Commun. Math. Stat."},{"issue":"8","key":"1738_CR38","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1016\/j.aml.2005.10.011","volume":"19","author":"JF Qian","year":"2006","unstructured":"Qian, J.F., Zhang, L.N., Zhu, S.X.: $$(1+u)$$-constacyclic and cyclic codes over $$\\mathbb{F}_2+u\\mathbb{F}_2$$. Appl. Math. Lett. 19(8), 820\u2013823 (2006)","journal-title":"Appl. Math. Lett."},{"issue":"1","key":"1738_CR39","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/A:1008356131869","volume":"21","author":"I Siap","year":"2000","unstructured":"Siap, I., Ray-Chaudhuri, D.K.: New linear codes over $$\\mathbb{F}_3$$ and $$\\mathbb{F}_5$$ and improvements on bounds. Des. Codes Crypt. 21(1), 223\u2013233 (2000)","journal-title":"Des. Codes Crypt."},{"issue":"10","key":"1738_CR40","doi-asserted-by":"publisher","first-page":"2764","DOI":"10.1109\/TIT.2002.802639","volume":"48","author":"I Siap","year":"2002","unstructured":"Siap, I., Ray-Chaudhuri, D.K.: New linear codes over $$\\mathbb{F}_5$$ obtained by tripling method and improvements on bounds. IEEE Trans. Inf. Theory 48(10), 2764\u20132768 (2002)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1738_CR41","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1109\/18.75250","volume":"37","author":"JH Van Lint","year":"1991","unstructured":"Van Lint, J.H.: Repeated-root cyclic codes. IEEE Trans. Inf. Theory 37(2), 343\u2013345 (1991)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-022-01738-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-022-01738-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-022-01738-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T23:02:14Z","timestamp":1674860534000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-022-01738-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,5]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1738"],"URL":"https:\/\/doi.org\/10.1007\/s12190-022-01738-7","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2022,5,5]]},"assertion":[{"value":"17 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 April 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}