{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T13:09:00Z","timestamp":1779887340956,"version":"3.53.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T00:00:00Z","timestamp":1776988800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T00:00:00Z","timestamp":1776988800000},"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":[[2026,5]]},"DOI":"10.1007\/s12190-026-02816-w","type":"journal-article","created":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T14:36:01Z","timestamp":1777041361000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal symbol-pair constacyclic codes of length $$3p$$: new conditions and constructions"],"prefix":"10.1007","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0724-2809","authenticated-orcid":false,"given":"Hieu V.","family":"Ha","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,24]]},"reference":[{"key":"2816_CR1","doi-asserted-by":"publisher","unstructured":"Cassuto, Y., Blaum, M.: Codes for symbol-pair read channels. Conf. Proc. IEEE Int. Symp. Inf. Theory, Austin, TX, USA 988\u2013992 (2010, Jun). https:\/\/doi.org\/10.1109\/ISIT.2010.5513753","DOI":"10.1109\/ISIT.2010.5513753"},{"key":"2816_CR2","doi-asserted-by":"publisher","unstructured":"Cassuto, Y., Blaum, M.: Codes for symbol-pair read channels. IEEE Trans. Inf. Theory 57(12), 8011\u20138020 (2011). https:\/\/doi.org\/10.1109\/TIT.2011.2164891","DOI":"10.1109\/TIT.2011.2164891"},{"key":"2816_CR3","doi-asserted-by":"publisher","unstructured":"Cassuto, Y., Litsyn, S.: Symbol-pair codes: algebraic constructions and asymptotic bounds. Conf. Proc. IEEE Int. Symp. Inf. Theory, St. Petersburg, Russia 2348\u20132352 (2011). https:\/\/doi.org\/10.1109\/ISIT.2011.6033982","DOI":"10.1109\/ISIT.2011.6033982"},{"key":"2816_CR4","doi-asserted-by":"publisher","unstructured":"Chee, Y.M., Kiah, H.M., Wang, C.: Maximum distance separable symbol-pair codes. Proc. IEEE Int. Symp. Inf. Theory (ISIT), 2886\u20132890 (2012). https:\/\/doi.org\/10.1109\/ISIT.2012.6284052","DOI":"10.1109\/ISIT.2012.6284052"},{"key":"2816_CR5","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1109\/TIT.2013.2276615","DOI":"10.1109\/TIT.2013.2276615"},{"issue":"11","key":"2816_CR6","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). https:\/\/doi.org\/10.1109\/TIT.2015.2481889","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2816_CR7","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). https:\/\/doi.org\/10.1007\/s10623-016-0271-y","journal-title":"Des. Codes Cryptogr."},{"issue":"11","key":"2816_CR8","doi-asserted-by":"publisher","first-page":"7701","DOI":"10.1109\/TIT.2024.3466523","volume":"70","author":"X. Kai","year":"2024","unstructured":"Kai, X., Zhou, Y., Zhu, S.: Two new classes of MDS symbol-pair codes. IEEE Trans. Inf. Theory 70(11), 7701\u20137710 (2024). https:\/\/doi.org\/10.1109\/TIT.2024.3466523","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"2816_CR9","doi-asserted-by":"publisher","first-page":"4857","DOI":"10.1007\/s10623-025-01705-w","volume":"93","author":"R. Qiu","year":"2025","unstructured":"Qiu, R., Fang, W.: New constructions of MDS symbol-pair codes via simple-root cyclic codes. Des. Codes Cryptogr. 93(11), 4857\u20134886 (2025). https:\/\/doi.org\/10.1007\/s10623-025-01705-w","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"2816_CR10","doi-asserted-by":"publisher","first-page":"2417","DOI":"10.1109\/TIT.2017.2726691","volume":"64","author":"H.Q. 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). https:\/\/doi.org\/10.1109\/TIT.2017.2726691","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2816_CR11","doi-asserted-by":"publisher","unstructured":"Dinh, H.Q., Wang, X., Liu, H., Sriboonchitta, S.: On the symbol-pair distances of repeated-root constacyclic codes of length $$2p^s$$. Discrete Math. 342(11), 3062\u20133078 (2019). https:\/\/doi.org\/10.1016\/j.disc.2019.06.017","DOI":"10.1016\/j.disc.2019.06.017"},{"key":"2816_CR12","doi-asserted-by":"publisher","unstructured":"Dinh, H.Q., Nguyen, B.T., Sriboonchitta, S.: MDS symbol-pair codes of length $$2p^s$$ over $$\\mathbb{F}_{p^m}$$\u201d. IEEE Trans. Inf. Theory 60, 240\u2013262 (2020). https:\/\/doi.org\/10.1109\/TIT.2019.2941885","DOI":"10.1109\/TIT.2019.2941885"},{"key":"2816_CR13","doi-asserted-by":"publisher","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}$$. Cryptogr. Commun. 10, 643\u2013653 (2018). https:\/\/doi.org\/10.1007\/s12095-017-0249-2","DOI":"10.1007\/s12095-017-0249-2"},{"issue":"1","key":"2816_CR14","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10623-021-00967-4","volume":"90","author":"J. Ma","year":"2022","unstructured":"Ma, J., Luo, J.: MDS symbol-pair codes from repeated-root cyclic codes. Des. Codes Cryptogr. 90(1), 121\u2013137 (2022). https:\/\/doi.org\/10.1007\/s10623-021-00967-4","journal-title":"Des. Codes Cryptogr."},{"issue":"10","key":"2816_CR15","doi-asserted-by":"publisher","first-page":"2337","DOI":"10.1007\/s10623-022-01081-9","volume":"90","author":"J. Ma","year":"2022","unstructured":"Ma, J., Luo, J.: Constructions of MDS symbol-pair codes with minimum distance seven or eight. Des. Codes Cryptogr. 90(10), 2337\u20132359 (2022). https:\/\/doi.org\/10.1007\/s10623-022-01081-9","journal-title":"Des. Codes Cryptogr."},{"key":"2816_CR16","doi-asserted-by":"publisher","unstructured":"Li, F.: Cyclic codes of length $$5p$$ with MDS symbol-pair. Des. Codes Cryptogr. 91, 1873\u20131888 (2023). https:\/\/doi.org\/10.1007\/s10623-023-01184-x","DOI":"10.1007\/s10623-023-01184-x"},{"issue":"7","key":"2816_CR17","doi-asserted-by":"publisher","first-page":"113391","DOI":"10.1016\/j.disc.2023.113391","volume":"346","author":"J. Ma","year":"2023","unstructured":"Ma, J., Luo, J.: AMDS symbol-pair codes from repeated-root cyclic codes. Discrete Math. 346(7), 113391 (2023). https:\/\/doi.org\/10.1016\/j.disc.2023.113391","journal-title":"Discrete Math."},{"key":"2816_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/IWSDA50346.2022.9870584","volume-title":"10-Th International Workshop on Signal Design and Its Applications in Communications (IWSDA)","author":"X. Tang","year":"2022","unstructured":"Tang, X., Luo, R.: A new class of AMDS symbol-pair codes. In: 10-Th International Workshop on Signal Design and Its Applications in Communications (IWSDA), pp. 1\u20134. Colchester, United Kingdom (2022). https:\/\/doi.org\/10.1109\/IWSDA50346.2022.9870584"},{"key":"2816_CR19","doi-asserted-by":"publisher","first-page":"102203","DOI":"10.1016\/j.ffa.2023.102203","volume":"89","author":"X. Tang","year":"2023","unstructured":"Tang, X., Luo, R.: MDS and AMDS symbol-pair codes constructed from repeated-root cyclic codes. Finite Fields Their Appl. 89, 102203 (2023). https:\/\/doi.org\/10.1016\/j.ffa.2023.102203","journal-title":"Finite Fields Their Appl."},{"key":"2816_CR20","doi-asserted-by":"publisher","unstructured":"Dinh, H.Q., Ha, H.V., Nguyen, B.T., Vo, T.N.: Two new classes of AMDS symbol-pair cyclic codes of length $$4p$$. J. Appl. Math. Comput. 70, 4117\u20134131 (2024). https:\/\/doi.org\/10.1007\/s12190-024-02127-y","DOI":"10.1007\/s12190-024-02127-y"},{"key":"2816_CR21","doi-asserted-by":"publisher","unstructured":"Dinh, H.Q., Ha, H.V., Nguyen, B.T., Vo, T.N.: A new family of AMDS symbol-pair constacyclic codes of length $$4p$$ and symbol-pair distance $$9$$. Des. Codes Cryptogr. 93, 2333\u20132347 (2025). https:\/\/doi.org\/10.1007\/s10623-025-01600-4","DOI":"10.1007\/s10623-025-01600-4"},{"key":"2816_CR22","doi-asserted-by":"publisher","first-page":"139071","DOI":"10.1109\/ACCESS.2025.3590462","volume":"13","author":"H.Q. Dinh","year":"2025","unstructured":"Dinh, H.Q., Nguyen, B.T., Thi, H.L., Yamaka, W.: A family of almost MDS symbol-pair codes of length 8p. IEEE. Access 13, 139071\u2013139079 (2025). https:\/\/doi.org\/10.1109\/ACCESS.2025.3590462","journal-title":"IEEE. Access"},{"issue":"12","key":"2816_CR23","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). https:\/\/doi.org\/10.1109\/TIT.2017.2753250","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"2816_CR24","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/TIT.1964.1053661","volume":"10","author":"R.C. Singleton","year":"1964","unstructured":"Singleton, R.C.: Maximum distance q-nary codes. IEEE Trans. Inf. Theory 10(2), 116\u2013118 (1964). https:\/\/doi.org\/10.1109\/TIT.1964.1053661","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2816_CR25","doi-asserted-by":"publisher","unstructured":"Dinh, H.Q., Wang, X., Liu, H., Yamaka, W.: Hamming distances of constacyclic codes of length $$3p^s$$ and optimal codes with respect to the Griesmer and Singleton bounds. Finite Fields Appl. 70, 101794 (2021). https:\/\/doi.org\/10.1016\/j.ffa.2020.101794","DOI":"10.1016\/j.ffa.2020.101794"},{"key":"2816_CR26","volume-title":"\u201cAlgebraic Coding Theory\u201d","author":"E.R. Berlekamp","year":"1984","unstructured":"Berlekamp, E.R.: \u201cAlgebraic Coding Theory\u201d. Aegean Park Press, Laguna Hills, CA (1984)"},{"issue":"3","key":"2816_CR27","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). https:\/\/doi.org\/10.1109\/LCOMM.2018.2791422","journal-title":"IEEE Commun. Lett."},{"key":"2816_CR28","unstructured":"Prange, E.: \u201cCyclic error-correcting codes in two symbols\u201d, AFCRCTN-57-103. USAF Cambridge Research Laboratories. (1957, Sep)"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-026-02816-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-026-02816-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-026-02816-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T12:30:26Z","timestamp":1779885026000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-026-02816-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,24]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["2816"],"URL":"https:\/\/doi.org\/10.1007\/s12190-026-02816-w","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,24]]},"assertion":[{"value":"14 January 2026","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2026","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 have no conflict of interest related to this publication.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"161"}}