{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T10:59:14Z","timestamp":1785149954110,"version":"3.55.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"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,7]]},"DOI":"10.1007\/s12190-026-02855-3","type":"journal-article","created":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T13:24:28Z","timestamp":1783344268000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Construction of almost MDS symbol-pair codes via codes over finite rings"],"prefix":"10.1007","volume":"72","author":[{"given":"Yiwu","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4384-1470","authenticated-orcid":false,"given":"Xiaoshan","family":"Kai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jian","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,6]]},"reference":[{"key":"2855_CR1","doi-asserted-by":"crossref","unstructured":"Cassuto, Y., Blaum, M.: Codes for symbol-pair read channels. In: Proc. Int. Symp. Inf. Theory, pp. 988\u2013992. Austin, TX, USA (2010).","DOI":"10.1109\/ISIT.2010.5513753"},{"issue":"12","key":"2855_CR2","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). https:\/\/doi.org\/10.1109\/TIT.2011.2164891.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2855_CR3","doi-asserted-by":"crossref","unstructured":"Chee, Y.M., Kiah, H.M., Wang, C.: Maximum distance separable symbol-pair codes. In: Proc. Int. Symp. Inf. Theory, pp. 2886\u20132890. Cambridge, MA, USA (2012).","DOI":"10.1109\/ISIT.2012.6284052"},{"issue":"11","key":"2855_CR4","doi-asserted-by":"publisher","first-page":"7259","DOI":"10.1109\/TIT.2013.2276615","volume":"59","author":"Y.M. 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). https:\/\/doi.org\/10.1109\/TIT.2013.2276615.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"2855_CR5","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"},{"key":"2855_CR6","doi-asserted-by":"publisher","first-page":"4117","DOI":"10.1007\/s12190-024-02127-y","volume":"70","author":"H.Q. Dinh","year":"2024","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).","journal-title":"J. Appl. Math. Comput."},{"issue":"2","key":"2855_CR7","doi-asserted-by":"publisher","first-page":"2333","DOI":"10.1007\/s10623-025-01600-4","volume":"93","author":"H.Q. Dinh","year":"2025","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(2), 2333\u20132347 (2025).","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"2855_CR8","doi-asserted-by":"publisher","first-page":"2417","DOI":"10.1109\/TIT.2017.2726691","volume":"64","author":"H.Q. 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"},{"key":"2855_CR9","doi-asserted-by":"crossref","unstructured":"Dinh, H.Q., Nguyen, B.T., Sriboonchitta, S.: MDS symbol-pair cyclic codes of length $$2p^s$$ over $$\\mathbb{F}_{p^{m}}$$. IEEE Trans Inf Theory 66(1), 240\u2013262 (2020).","DOI":"10.1109\/TIT.2019.2941885"},{"key":"2855_CR10","doi-asserted-by":"crossref","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).","DOI":"10.1016\/j.disc.2019.06.017"},{"key":"2855_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"W. Huffman","year":"2003","unstructured":"Huffman, W., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)."},{"issue":"11","key":"2855_CR12","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":"2855_CR13","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"},{"key":"2855_CR14","doi-asserted-by":"crossref","unstructured":"Kai, X.S., Zhu, S.X., Li, P.: $$(1+\\lambda u)$$-constacyclic codes over $$F_{p}[u]\/\\langle u^m\\rangle$$. J. Franklin Inst. 347(5), 751\u2013762 (2010).","DOI":"10.1016\/j.jfranklin.2010.02.003"},{"issue":"3","key":"2855_CR15","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."},{"issue":"3","key":"2855_CR16","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":"3","key":"2855_CR17","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1109\/TIT.2022.3220638","volume":"69","author":"G. Luo","year":"2023","unstructured":"Luo, G., Ezerman, M.F., Ling, S., Pan, X.: New families of MDS symbol-pair codes from matrix-product codes. IEEE Trans. Inf. Theory 69(3), 1567\u20131587 (2023). https:\/\/doi.org\/10.1109\/TIT.2022.3220638.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2855_CR18","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":"2855_CR19","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."},{"issue":"7","key":"2855_CR20","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."},{"issue":"3","key":"2855_CR21","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1109\/18.841186","volume":"46","author":"J. Ma","year":"2000","unstructured":"Ma, J., Luo, J.: On the Hamming distance of linear codes over a finite chain ring. IEEE Trans Inf Theory 46(3), 1060\u20131067 (2000).","journal-title":"IEEE Trans Inf Theory"},{"key":"2855_CR22","doi-asserted-by":"crossref","unstructured":"Ozen, M., Siap, I.: Linear codes over $$\\mathbb{F}_q[u]\/(u^s)$$ with respect to the Rosenbloom-Tsfasman metric. Des. Codes Cryptogr. 38, 17\u201329 (2006).","DOI":"10.1007\/s10623-004-5658-5"},{"key":"2855_CR23","doi-asserted-by":"crossref","unstructured":"Qian, J., Zhang, L., Zhu, S.: DFT for cyclic code over $$F_p + uF_p + \\cdots+u^{k-1}F_p$$. J. Appl. Math. Comput. 22(1\u20132), 159\u2013167 (2006).","DOI":"10.1007\/BF02896468"},{"issue":"8","key":"2855_CR24","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(8), 4857\u20134886 (2025). https:\/\/doi.org\/10.1007\/s10623-025-01705-w.","journal-title":"Des. Codes Cryptogr."},{"key":"2855_CR25","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 Appl. 89, 102203 (2023). https:\/\/doi.org\/10.1016\/j.ffa.2023.102203.","journal-title":"Finite Fields Appl."},{"issue":"9","key":"2855_CR26","doi-asserted-by":"publisher","first-page":"5327","DOI":"10.1007\/s10623-025-01727-4","volume":"93","author":"X. Zheng","year":"2025","unstructured":"Zheng, X., Wang, L., Zhu, S.: Several new classes of MDS symbol-pair codes. Des. Codes Cryptogr. 93(9), 5327\u20135356 (2025). https:\/\/doi.org\/10.1007\/s10623-025-01727-4.","journal-title":"Des. Codes Cryptogr."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-026-02855-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-026-02855-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-026-02855-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T10:02:05Z","timestamp":1785146525000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-026-02855-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":26,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["2855"],"URL":"https:\/\/doi.org\/10.1007\/s12190-026-02855-3","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"2 January 2026","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare there are no conflicts of interest.","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"201"}}