{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:40:21Z","timestamp":1761061221950},"reference-count":24,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2022]]},"abstract":"<p style='text-indent:20px;'>In this paper, we introduce two classes of MacDonald codes over the finite non-chain ring <inline-formula><tex-math id=\"M1\">\\begin{document}$ \\mathbb{F}_p+v\\mathbb{F}_p+v^2\\mathbb{F}_p $\\end{document}<\/tex-math><\/inline-formula> and their torsion codes which are linear codes over <inline-formula><tex-math id=\"M2\">\\begin{document}$ \\mathbb{F}_p $\\end{document}<\/tex-math><\/inline-formula>, where <inline-formula><tex-math id=\"M3\">\\begin{document}$ p $\\end{document}<\/tex-math><\/inline-formula> is an odd prime and <inline-formula><tex-math id=\"M4\">\\begin{document}$ v^3 = v $\\end{document}<\/tex-math><\/inline-formula>. We give the complete weight enumerator of two classes of torsion codes. As an application, systematic authentication codes are obtained by these torsion codes.<\/p><\/jats:p>","DOI":"10.3934\/amc.2020124","type":"journal-article","created":{"date-parts":[[2021,1,8]],"date-time":"2021-01-08T12:13:10Z","timestamp":1610107990000},"page":"571","source":"Crossref","is-referenced-by-count":14,"title":["Complete weight enumerator of torsion codes"],"prefix":"10.3934","volume":"16","author":[{"given":"Xiangrui","family":"Meng","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Shandong University of Technology, Zibo, Shandong 255000, China"}]},{"given":"Jian","family":"Gao","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Shandong University of Technology, Zibo, Shandong 255000, China"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2020124-1","doi-asserted-by":"publisher","unstructured":"S. Bae, C. Li, Q. Yue.On the complete weight enumerators of some reducible cyclic codes, Discrete Mathematics<\/i>, 60<\/b> (2015), 2275-2287.","DOI":"10.1016\/j.disc.2015.05.016"},{"key":"key-10.3934\/amc.2020124-2","doi-asserted-by":"publisher","unstructured":"I. F. Blake, K. Kith.On the complete weight enumerator of Reed-Solomon codes, SIAM Journal on Discrete Mathematics<\/i>, 4<\/b> (1991), 164-171.","DOI":"10.1137\/0404016"},{"key":"key-10.3934\/amc.2020124-3","unstructured":"Y. Cengellenmis, M. Department.MacDonald codes over the ring $\\mathbb{F}_3+ v\\mathbb{F}_3$, IUG Journal of Natural and Engineering Studues<\/i>, 20<\/b> (2012), 109-112."},{"key":"key-10.3934\/amc.2020124-4","unstructured":"C. Colbourn, M. Gupta.On quaternary MacDonald codes, Proceedings ITCC 2003, International Conference on Information Technology: Coding and Computing<\/i>, 5<\/b> (2003), 212-215."},{"key":"key-10.3934\/amc.2020124-5","unstructured":"A. Dertli, Y. Cengellenmis.Macdonald codes over the ring $\\mathbb{F}_2+v\\mathbb{F}_2$, International Journal of Algebra<\/i>, 5<\/b> (2011), 985-991."},{"key":"key-10.3934\/amc.2020124-6","doi-asserted-by":"publisher","unstructured":"L. Diao, J. Gao and J. Lu, On $\\mathbb{Z}_{p}\\mathbb{Z}_{p}[v]$-additive cyclic codes, Advances in Mathematics of Communications<\/i>, 14<\/b>, (2020), 555\u2013572.","DOI":"10.3934\/amc.2018038"},{"key":"key-10.3934\/amc.2020124-7","doi-asserted-by":"publisher","unstructured":"C. Ding, J. Yin.Algebraic constructions of constant composition codes, International Conference on Information Technology<\/i>, 51<\/b> (2005), 1585-1589.","DOI":"10.1109\/TIT.2005.844087"},{"key":"key-10.3934\/amc.2020124-8","doi-asserted-by":"publisher","unstructured":"C. Ding, X. Wang.A coding theory construction of new systematic authentication codes, Theoretical Computer Science<\/i>, 330<\/b> (2005), 81-99.","DOI":"10.1016\/j.tcs.2004.09.011"},{"key":"key-10.3934\/amc.2020124-9","doi-asserted-by":"publisher","unstructured":"C. Ding, T. Helleseth, T. Kl\u00f8ve, X. Wang.A generic construction of Cartesian authentication codes, IEEE Transactions on Information Theory<\/i>, 53<\/b> (2007), 2229-2235.","DOI":"10.1109\/TIT.2007.896872"},{"key":"key-10.3934\/amc.2020124-10","doi-asserted-by":"publisher","unstructured":"T. Helleseth, A. Kholosha.Monomial and quadratic bent functions over the finite fields of odd characteristic, IEEE Transactions on Information Theory<\/i>, 52<\/b> (2006), 2018-2032.","DOI":"10.1109\/TIT.2006.872854"},{"key":"key-10.3934\/amc.2020124-11","unstructured":"X. Hou and J. Gao, $\\mathbb{Z}_{p}\\mathbb{Z}_{p}[v]$-additive cyclic codes are asymptotically good, Journal of Applied Mathematics and Computing<\/i>, (2020), https:\/\/doi.org\/10.1007\/s12190-020-01466-w<\/a>."},{"key":"key-10.3934\/amc.2020124-12","doi-asserted-by":"publisher","unstructured":"A. Kuzmin, A. Nechaev.Complete weight enumerators of generalized Kerdock code and related linear codes over Galois ring, Discrete Applied Mathematics<\/i>, 111<\/b> (2001), 117-137.","DOI":"10.1016\/S0166-218X(00)00348-6"},{"key":"key-10.3934\/amc.2020124-13","doi-asserted-by":"publisher","unstructured":"C. Li, Q. Yue, F.-W. Fu.Complete weight enumerators of some cyclic codes, Designs, Codes and Crytography<\/i>, 80<\/b> (2016), 295-315.","DOI":"10.1007\/s10623-015-0091-5"},{"key":"key-10.3934\/amc.2020124-14","doi-asserted-by":"publisher","unstructured":"C. Li, S. Bae, J. Ahn, S. Yang, Z. Yao.Complete weight enumerators of some linear codes and their applications, Designs, Codes and Cryptography<\/i>, 81<\/b> (2016), 153-168.","DOI":"10.1007\/s10623-015-0136-9"},{"key":"key-10.3934\/amc.2020124-15","doi-asserted-by":"publisher","unstructured":"J. Luo, T. Helleset.Constant composition codes as subcodes of cyclic codes, IEEE Transactions on Information Theory<\/i>, 57<\/b> (2011), 7482-7488.","DOI":"10.1109\/TIT.2011.2161631"},{"key":"key-10.3934\/amc.2020124-16","doi-asserted-by":"publisher","unstructured":"J. E. MacDonald.Design methods for maximum minimum-distance error-correcting codes, IBM Journal of Research and Development<\/i>, 4<\/b> (1960), 43-57.","DOI":"10.1147\/rd.41.0043"},{"key":"key-10.3934\/amc.2020124-17","unstructured":"F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-correcting Codes<\/i>, North-Holland, Amsterdam, 1977."},{"key":"key-10.3934\/amc.2020124-18","doi-asserted-by":"publisher","unstructured":"A. M. Patel.Maximal $q$-ary linear codes with large minimum distance, IEEE Transactions on Information Theory<\/i>, 21<\/b> (1975), 106-110.","DOI":"10.1109\/tit.1975.1055315"},{"key":"key-10.3934\/amc.2020124-19","doi-asserted-by":"publisher","unstructured":"R. S. Rees, D. R. Stinson.Combinatorial characterizations of authentication codes \u2161, Designs, Codes and Cryptography<\/i>, 2<\/b> (1992), 175-187.","DOI":"10.1007\/BF00124896"},{"key":"key-10.3934\/amc.2020124-20","doi-asserted-by":"crossref","unstructured":"G. J. Simmons, Authentication theory coding theory, International Cryptology Conference<\/i>, (1985), 411\u20134317.","DOI":"10.1007\/3-540-39568-7_32"},{"key":"key-10.3934\/amc.2020124-21","doi-asserted-by":"publisher","unstructured":"X. Wang, J. Gao, F.-W. Fu.Secret sharing schemes from linear codes over $\\mathbb{F}_p+ v\\mathbb{F}_p$, International Journal of Foundations of Computer Science<\/i>, 27<\/b> (2016), 595-605.","DOI":"10.1142\/S0129054116500180"},{"key":"key-10.3934\/amc.2020124-22","doi-asserted-by":"publisher","unstructured":"X. Wang, J. Gao, F.-W. Fu.Complete weight enumerators of two classes of linear codes, Cryptography and Communications<\/i>, 9<\/b> (2017), 545-562.","DOI":"10.1007\/s12095-016-0198-1"},{"key":"key-10.3934\/amc.2020124-23","doi-asserted-by":"publisher","unstructured":"Y. Wang and J. Gao, MacDonald codes over the ring $\\mathbb{F}_p+ v\\mathbb{F}_p+v^2\\mathbb{F}_p$, Computational and Applied Mathematics<\/i>, 38<\/b> (2019), 169.","DOI":"10.1007\/s40314-019-0937-y"},{"key":"key-10.3934\/amc.2020124-24","doi-asserted-by":"publisher","unstructured":"S. Yang, Z. Yao.Complete weight enumerators of a family of three-weight linear codes, Designs, Codes and Cryptography<\/i>, 82<\/b> (2017), 663-674.","DOI":"10.1007\/s10623-016-0191-x"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"http:\/\/aimsciences.org\/\/article\/doi\/10.3934\/amc.2020124?viewType=html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,29]],"date-time":"2022-06-29T09:26:06Z","timestamp":1656494766000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/article\/doi\/10.3934\/amc.2020124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022]]}},"alternative-id":["1930-5346_2022_3_571"],"URL":"https:\/\/doi.org\/10.3934\/amc.2020124","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}