{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:05:01Z","timestamp":1757617501551,"version":"3.44.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T00:00:00Z","timestamp":1741046400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T00:00:00Z","timestamp":1741046400000},"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":[[2025,8]]},"DOI":"10.1007\/s12190-025-02423-1","type":"journal-article","created":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T21:46:12Z","timestamp":1741038372000},"page":"5087-5101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the MDS b-symbol of repeated-root constacyclic codes of prime power length over $$ \\mathbb {F}_{p^{m}} + u\\mathbb {F}_{p^{m}}+u^{2}\\mathbb {F}_{p^{m}} $$"],"prefix":"10.1007","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-9856-8813","authenticated-orcid":false,"given":"Youssef","family":"Ahendouz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ismail","family":"Akharraz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,4]]},"reference":[{"issue":"12","key":"2423_CR1","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"},{"issue":"4","key":"2423_CR2","doi-asserted-by":"publisher","first-page":"1541","DOI":"10.1109\/TIT.2016.2522434","volume":"62","author":"E Yaakobi","year":"2016","unstructured":"Yaakobi, E., Bruck, J., Siegel, P.H.: Constructions and decoding of cyclic codes over $$b$$-symbol read channels. IEEE Trans. Inf. Theory 62(4), 1541\u20131551 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2423_CR3","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ffa.2007.07.001","volume":"14","author":"HQ Dinh","year":"2008","unstructured":"Dinh, H.Q.: On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions. Finite Fields Their Appl. 14(1), 22\u201340 (2008)","journal-title":"Finite Fields Their Appl."},{"issue":"4","key":"2423_CR4","doi-asserted-by":"publisher","first-page":"2417","DOI":"10.1109\/TIT.2017.2726691","volume":"64","author":"HQ Dinh","year":"2017","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 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"2423_CR5","doi-asserted-by":"publisher","first-page":"2050209","DOI":"10.1142\/S0219498820502096","volume":"19","author":"HQ Dinh","year":"2020","unstructured":"Dinh, H.Q., Satpati, S., Singh, A.K., Yamaka, W.: Symbol-triple distance of repeated-root constacyclic codes of prime power lengths. J. Algebra Its Appl. 19(11), 2050209 (2020)","journal-title":"J. Algebra Its Appl."},{"issue":"4","key":"2423_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2019.111780","volume":"343","author":"HQ Dinh","year":"2020","unstructured":"Dinh, H.Q., Wang, X., Liu, H., Sriboonchitta, S.: On the $$b$$-distance of repeated-root constacyclic codes of prime power lengths. Discrete Math. 343(4), 111780 (2020)","journal-title":"Discrete Math."},{"issue":"8","key":"2423_CR7","doi-asserted-by":"publisher","first-page":"2050151","DOI":"10.1142\/S0219498820501510","volume":"19","author":"HQ Dinh","year":"2020","unstructured":"Dinh, H.Q., Wang, X., Sirisrisakulchai, J.: Optimal $$b$$-symbol constacyclic codes with respect to the singleton bound. J. Algebra Its Appl. 19(8), 2050151 (2020)","journal-title":"J. Algebra Its Appl."},{"key":"2423_CR8","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s12095-017-0249-2","volume":"10","author":"Z Sun","year":"2018","unstructured":"Sun, Z., Zhu, S., Wang, L.: The symbol-pair distance distribution of a class of repeated-root cyclic codes over $${\\mathbb{F} }_{p^m} + {{\\mathbb{F} }}_{p^m}$$. Cryptograp. Commun. 10, 643\u2013653 (2018)","journal-title":"Cryptograp. Commun."},{"key":"2423_CR9","doi-asserted-by":"publisher","first-page":"67330","DOI":"10.1109\/ACCESS.2020.2985714","volume":"8","author":"HQ Dinh","year":"2020","unstructured":"Dinh, H.Q., Gaur, A., Singh, A.K., Singh, M.K., Yamaka, W.: $$b$$-symbol distance of Constacyclic codes of length $$p^s$$ Over $${{\\mathbb{F} }}_{p^m} + u {{\\mathbb{F} }}_{p^m}$$. IEEE Access 8, 67330\u201367341 (2020)","journal-title":"IEEE Access"},{"key":"2423_CR10","doi-asserted-by":"publisher","first-page":"23578","DOI":"10.1109\/ACCESS.2023.3245520","volume":"11","author":"HQ Dinh","year":"2023","unstructured":"Dinh, H.Q., Nguyen, B.T., Luu, H.T., Yamaka, W.: On symbol-triple distance of a class of constacyclic codes of length $$3p^s$$ Over $${{\\mathbb{F} }}_{p^m} + u {{\\mathbb{F} }}_{p^m}$$. IEEE Access 11, 23578\u201323585 (2023)","journal-title":"IEEE Access"},{"issue":"3","key":"2423_CR11","doi-asserted-by":"publisher","first-page":"254","DOI":"10.3390\/axioms12030254","volume":"12","author":"HQ Dinh","year":"2023","unstructured":"Dinh, H.Q., Thi, H.L., Tansuchat, R.: On symbol-pair distance of a class of constacyclic codes of length $$3p^s$$ over $${\\mathbb{F} }_{p^m} + u {\\mathbb{F} }_{p^m}$$. Axioms 12(3), 254 (2023)","journal-title":"Axioms"},{"issue":"6","key":"2423_CR12","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1007\/s00200-021-00534-3","volume":"34","author":"HQ Dinh","year":"2023","unstructured":"Dinh, H.Q., Singh, A.K., Thakur, M.K.: On symbol-pair distances of repeated-root constacyclic codes of length $$2p^s$$ over $${\\mathbb{F} }_{p^m} + u {\\mathbb{F} }_{p^m}$$ and MDS symbol-pair codes. Appl. Algebra Eng. Commun. Comput. 34(6), 1027\u20131043 (2023)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"2423_CR13","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s12190-020-01456-y","volume":"66","author":"HQ Dinh","year":"2021","unstructured":"Dinh, H.Q., Singh, A.K., Thakur, M.K.: On hamming and $$b$$-symbol distance distributions of repeated-root constacyclic codes of length $$4p^s$$ over $${\\mathbb{F} }_{p^m} + u {\\mathbb{F} }_{p^m}$$. J. Appl. Math. Comput. 66, 885\u2013905 (2021)","journal-title":"J. Appl. Math. Comput."},{"issue":"6","key":"2423_CR14","doi-asserted-by":"publisher","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^2 \\rangle $$. Discrete Math. 344(6), 112325 (2021)","journal-title":"Discrete Math."},{"key":"2423_CR15","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":"20","key":"2423_CR16","doi-asserted-by":"publisher","first-page":"2554","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), 2554 (2021)","journal-title":"Mathematics"},{"issue":"14","key":"2423_CR17","doi-asserted-by":"publisher","first-page":"2496","DOI":"10.3390\/math10142496","volume":"10","author":"HQ Dinh","year":"2022","unstructured":"Dinh, H.Q., Laaouine, J., Boudine, B., Yamaka, W.: Symbol-triple distance of repeated-root constacyclic codes of prime power lengths over $${\\mathbb{F} }_q + u {\\mathbb{F} }_q + u^2 {\\mathbb{F} }_q$$. Mathematics 10(14), 2496 (2022)","journal-title":"Mathematics"},{"issue":"1","key":"2423_CR18","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s12190-022-01738-7","volume":"69","author":"J Laaouine","year":"2023","unstructured":"Laaouine, J., Dinh, H.Q., Charkani, M.E., Yamaka, W.: MDS symbol-pair repeated-root constacyclic codes of prime power lengths over $$\\mathbb{F} _q + u \\mathbb{F} _q + u^2 \\mathbb{F} _q$$. J. Appl. Math. Comput. 69(1), 219\u2013250 (2023)","journal-title":"J. Appl. Math. Comput."},{"key":"2423_CR19","doi-asserted-by":"publisher","first-page":"105","DOI":"10.61091\/ars-160-10","volume":"160","author":"Y Ahendouz","year":"2024","unstructured":"Ahendouz, Y., Akharraz, I.: A note on complete classification of repeated-root $$\\sigma $$-Constacyclic codes of prime power length over $${\\mathbb{F} }_{p^m}[u]\/\\langle u^3 \\rangle $$ and their hamming distances. Ars Combinatoria 160, 105\u2013115 (2024)","journal-title":"Ars Combinatoria"},{"key":"2423_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.ffa.2015.01.008","volume":"34","author":"R Sobhani","year":"2015","unstructured":"Sobhani, R.: Complete classification of $$(\\delta + \\alpha u^2)$$-Constacyclic Codes of Length $$p^k$$ Over $${\\mathbb{F} }_{p^m} + u {\\mathbb{F} }_{p^m} + u^2 {\\mathbb{F} }_{p^m}$$. Finite Fields Their Appl. 34, 123\u2013138 (2015)","journal-title":"Finite Fields Their Appl."},{"key":"2423_CR21","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 Their Appl. 49, 180\u2013197 (2018)","journal-title":"Finite Fields Their Appl."},{"issue":"12","key":"2423_CR22","doi-asserted-by":"publisher","first-page":"7848","DOI":"10.1109\/TIT.2019.2937858","volume":"65","author":"A Sharma","year":"2019","unstructured":"Sharma, A., Sidana, T.: On $$b$$-symbol distances of repeated-root constacyclic codes. IEEE Trans. Inf. Theory 65(12), 7848\u20137867 (2019)","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-025-02423-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-025-02423-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-025-02423-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T07:09:21Z","timestamp":1757142561000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-025-02423-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,4]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["2423"],"URL":"https:\/\/doi.org\/10.1007\/s12190-025-02423-1","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2025,3,4]]},"assertion":[{"value":"15 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there are no financial, professional, or personal Conflict of interest that could inappropriately influence the results or interpretations presented in this manuscript. This research was conducted independently, without any external interference, and the authors have no financial or professional affiliations with entities or organizations that could potentially benefit from this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}