{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T08:06:08Z","timestamp":1779782768106,"version":"3.53.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T00:00:00Z","timestamp":1741910400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T00:00:00Z","timestamp":1741910400000},"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":["AAECC"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s00200-025-00683-9","type":"journal-article","created":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T07:16:00Z","timestamp":1741936560000},"page":"661-680","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Two families of $${\\mathbb {Z}}_{p^{m}}$$-linear codes and their applications"],"prefix":"10.1007","volume":"37","author":[{"given":"J.","family":"Prabu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.","family":"Mahalakshmi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,3,14]]},"reference":[{"key":"683_CR1","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1111\/j.1469-1809.1941.tb02298.x","volume":"11","author":"RA Fisher","year":"1942","unstructured":"Fisher, R.A.: The theory of confounding in factorial experiments in relation to the theory of groups. Ann Eugen. 11, 341\u2013353 (1942)","journal-title":"Ann Eugen."},{"key":"683_CR2","first-page":"2283","volume":"12","author":"RA Fisher","year":"1945","unstructured":"Fisher, R.A.: A system of confounding for factors with more than two alternatives giving completely orthogonal cubes and higher powers. Ann Eugen. 12, 2283\u20132290 (1945)","journal-title":"Ann Eugen."},{"issue":"11","key":"683_CR3","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM. 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM."},{"key":"683_CR4","doi-asserted-by":"crossref","unstructured":"Radhakrishnan, S., Ishtiyaq Ahmed, S., Ramesh, S.R.: Implementation of Classical Error Control Codes for Memory Storage Systems Using VERILOG. In: Intelligent Sustainable Systems. Lecture Notes in Networks and Systems. 458, 29\u201341 (2022)","DOI":"10.1007\/978-981-19-2894-9_3"},{"key":"683_CR5","doi-asserted-by":"crossref","unstructured":"Tambatkar, S., Menon, S. N., Sudarshan, V., Vinodhini, M., Murty, N. S..: Error detection and correction in semiconductor memories using 3D parity check code with hamming code. In: International Conference on Communication and Signal Processing. IEEE (2017)","DOI":"10.1109\/ICCSP.2017.8286516"},{"issue":"1\u20133","key":"683_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(72)90024-6","volume":"3","author":"P Delsarte","year":"1972","unstructured":"Delsarte, P.: Weights of linear codes and strongly regular normed spaces. Discrete Math. 3(1\u20133), 47\u201364 (1972)","journal-title":"Discrete Math."},{"issue":"2","key":"683_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1112\/blms\/18.2.97","volume":"18","author":"R Calderbank","year":"1986","unstructured":"Calderbank, R., Kantor, W.M.: The geometry of two-weight codes. Bull. London Math. Soc. 18(2), 97\u2013122 (1986)","journal-title":"Bull. London Math. Soc."},{"key":"683_CR8","first-page":"123","volume":"4","author":"AA Nechaev","year":"1989","unstructured":"Nechaev, A.A.: Kerdock code in a cyclic form. Diskr Mat. 4, 123\u2013139 (1989)","journal-title":"Diskr Mat."},{"issue":"2","key":"683_CR9","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/18.312154","volume":"40","author":"AR Calderbank","year":"1994","unstructured":"Calderbank, A.R., Hammons, A.R., Jr., Kumar, P.V., Sloane, N.J.A., Sole, P.: The $${\\mathbb{Z} }_{4}$$-linearity of Kerdock, Preparata, Goethals and related codes. IEEE Trans. Inf. Theory 40(2), 301\u2013319 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"683_CR10","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/S0019-9958(72)90376-2","volume":"20","author":"AM Kerdock","year":"1972","unstructured":"Kerdock, A.M.: A class of low-rate nonlinear binary codes. Inf. Control 20(2), 182\u2013187 (1972)","journal-title":"Inf. Control"},{"issue":"4","key":"683_CR11","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/S0019-9958(68)90874-7","volume":"13","author":"FP Preparata","year":"1968","unstructured":"Preparata, F.P.: A class of optimum nonlinear double-error-correcting codes. Inf. Control. 13(4), 378\u2013400 (1968)","journal-title":"Inf. Control."},{"key":"683_CR12","doi-asserted-by":"crossref","unstructured":"Honold, T., Landjev, I.:Linearly representable codes over chain rings. In: Abhandlungen aus dem mathematischen Seminar der Universit\u00e4t Hamburg. vol.\u00a069, pp. 187\u2013203. Springer (1999)","DOI":"10.1007\/BF02940872"},{"issue":"3","key":"683_CR13","first-page":"18","volume":"35","author":"T Honold","year":"1999","unstructured":"Honold, T., Nechaev, A.A.: Weighted modules and representations of codes. Probl Peredachi Inf. 35(3), 18\u201339 (1999)","journal-title":"Probl Peredachi Inf."},{"key":"683_CR14","doi-asserted-by":"publisher","first-page":"R11","DOI":"10.37236\/1489","volume":"7","author":"T Honold","year":"2000","unstructured":"Honold, T., Landjev, I.: Linear codes over finite chain rings. Electron. J. Comb. 7, R11\u2013R11 (2000)","journal-title":"Electron. J. Comb."},{"key":"683_CR15","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0012-365X(00)00323-X","volume":"231","author":"T Honold","year":"2001","unstructured":"Honold, T., Landjev, I.: On arcs in projective Hjelmslev planes. Discrete Math. 231, 265\u2013278 (2001)","journal-title":"Discrete Math."},{"key":"683_CR16","doi-asserted-by":"crossref","unstructured":"Honold, T., Landjev, I.: Linear codes over finite chain rings and projective Hjelmslev geometries.,In: Codes Over Rings. pp. 60\u2013123. World Scientific (2009)","DOI":"10.1142\/9789812837691_0003"},{"issue":"1","key":"683_CR17","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10623-012-9650-1","volume":"66","author":"M Kiermaier","year":"2013","unstructured":"Kiermaier, M., Zwanzger, J.: New ring-linear codes from dualization in projective Hjelmslev geometries. Des. Codes Cryptogr. 66(1), 39\u201355 (2013)","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"683_CR18","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s12190-022-01736-9","volume":"69","author":"S Li","year":"2022","unstructured":"Li, S., Minjia, S.: Two infinite families of two-weight codes over $${\\mathbb{Z} }_{2^{m}}$$. J. Appl. Math. Comput. 69(1), 201\u2013218 (2022)","journal-title":"J. Appl. Math. Comput."},{"issue":"12","key":"683_CR19","doi-asserted-by":"publisher","first-page":"2493","DOI":"10.1007\/s10623-020-00796-x","volume":"88","author":"S Minjia","year":"2020","unstructured":"Minjia, S., Xuan, W., Sol\u00e9, P.: Two families of two-weight codes over $${\\mathbb{Z} }_{4}$$. Des. Codes. Cryptogr. 88(12), 2493\u20132505 (2020)","journal-title":"Des. Codes. Cryptogr."},{"issue":"5","key":"683_CR20","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1016\/j.jfranklin.2012.05.014","volume":"350","author":"S Minjia","year":"2013","unstructured":"Minjia, S., Zhu, S., Yang, S.: A class of optimal $$p$$-ary codes from one-weight codes over $${\\mathbb{F} }_{p}[u]$$. J. Franklin. Inst. 350(5), 929\u2013937 (2013)","journal-title":"J. Franklin. Inst."},{"issue":"4","key":"683_CR21","first-page":"799","volume":"22","author":"S Minjia","year":"2013","unstructured":"Minjia, S.: Optimal $$p$$-ary codes from one-weight linear codes over $$\\mathbb{Z} _{p^{m}}$$. Chin. J. Electron. 22(4), 799\u2013802 (2013)","journal-title":"Chin. J. Electron."},{"issue":"4","key":"683_CR22","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s11424-014-2188-8","volume":"27","author":"S Minjia","year":"2014","unstructured":"Minjia, S., Wang, Y.: Optimal binary codes from one-lee weight codes and two-lee weight projective codes over $${\\mathbb{Z} }_{4}$$. J. Syst. Sci. Complex. 27(4), 795\u2013810 (2014)","journal-title":"J. Syst. Sci. Complex."},{"issue":"1","key":"683_CR23","first-page":"527","volume":"51","author":"S Minjia","year":"2016","unstructured":"Minjia, S., Wang, D., Sol\u00e9, P.: Linear codes over $${\\mathbb{F} }_{3}+ u{\\mathbb{F} }_{3}+u^{2}\\mathbb{F} _{3}$$: MacWilliams identities, optimal ternary codes from one-Lee weight codes and two-Lee weight codes. J. Appl. Math. Comput. 51(1), 527\u2013544 (2016)","journal-title":"J. Appl. Math. Comput."},{"issue":"2","key":"683_CR24","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/s11424-016-5062-z","volume":"30","author":"S Minjia","year":"2017","unstructured":"Minjia, S., Yong, L., Sol\u00e9, P.: Construction of one-Lee weight and two-Lee weight codes over $$\\mathbb{F} _{p}+ v{\\mathbb{F} }_{p}$$. J. Syst. Sci. Complex. 30(2), 484\u2013493 (2017)","journal-title":"J. Syst. Sci. Complex."},{"issue":"2","key":"683_CR25","first-page":"125","volume":"15","author":"C Durairajan","year":"2015","unstructured":"Durairajan, C., Mahalakshmi, J.: On codes over integers modulo $$q$$. Adv. Appl. Discrete. Math. 15(2), 125\u2013143 (2015)","journal-title":"Adv. Appl. Discrete. Math."},{"issue":"03","key":"683_CR26","doi-asserted-by":"publisher","first-page":"1550030","DOI":"10.1142\/S1793830915500305","volume":"7","author":"C Durairajan","year":"2015","unstructured":"Durairajan, C., Mahalakshmi, J., Chella, Pandian P.: On the $${\\mathbb{Z} }_q$$-Simplex codes and its weight distribution for dimension 2. Discrete. Math. Algorithms. Appl. 7(03), 1550030 (2015)","journal-title":"Discrete. Math. Algorithms. Appl."},{"key":"683_CR27","doi-asserted-by":"crossref","unstructured":"Manish\u00a0Gupta, K., David\u00a0Glynn, G., Aaron\u00a0Gulliver, T.:On senary simplex codes. In: International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes. pp. 112\u2013121. Springer, Berlin, Heidelberg (2001)","DOI":"10.1007\/3-540-45624-4_12"},{"issue":"06","key":"683_CR28","doi-asserted-by":"publisher","first-page":"2250012","DOI":"10.1142\/S1793830922500124","volume":"14","author":"J Prabu","year":"2021","unstructured":"Prabu, J., Mahalakshmi, J., Durairajan, C., Santhakumar, S.: On some Punctured Codes of $${\\mathbb{Z} }_{q}$$-Simplex Codes. Discrete Math. Algorithms Appl. 14(06), 2250012 (2021)","journal-title":"Discrete Math. Algorithms Appl."},{"key":"683_CR29","unstructured":"Prabu, J., Mahalakshmi, J., Santhakumar, S.: Unit $${\\mathbb{Z} }_q$$-Simplex codes of type $$\\alpha$$ and zero divisor $${\\mathbb{Z} }_q$$-Simplex codes. Commun. Comb, Optim (2022)"},{"issue":"11","key":"683_CR30","doi-asserted-by":"publisher","first-page":"2529","DOI":"10.1007\/s10623-021-00914-3","volume":"90","author":"J Gao","year":"2021","unstructured":"Gao, J., Meng, X., Fu, F.W.: Weight distribution of double cyclic codes over Galois rings. Des. Codes Cryptogr. 90(11), 2529\u20132549 (2021)","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"683_CR31","doi-asserted-by":"publisher","first-page":"571","DOI":"10.3934\/amc.2020124","volume":"16","author":"X Meng","year":"2021","unstructured":"Meng, X., Gao, J.: Complete weight enumerator of torsion codes. Adv. Math. Commun. 16(3), 571\u2013596 (2021)","journal-title":"Adv. Math. Commun."},{"issue":"1","key":"683_CR32","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF01390768","volume":"6","author":"AR Calderbank","year":"1995","unstructured":"Calderbank, A.R., Sloane, N.J.: Modular and $$p$$-adic cyclic codes. Des. Codes Cryptogr. 6(1), 21\u201335 (1995)","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"683_CR33","first-page":"22","volume":"33","author":"I Constantinescu","year":"1997","unstructured":"Constantinescu, I., Heise, W.: A metric for codes over residue class rings. Probl. Peredachi Inf. 33(3), 22\u201328 (1997)","journal-title":"Probl. Peredachi Inf."},{"key":"683_CR34","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.ffa.2015.06.006","volume":"36","author":"H Ziling","year":"2015","unstructured":"Ziling, H., Qin, Y.: Generalized gray map and a class of $$p$$-ary nonlinear codes. Finite Fields Appl. 36, 81\u201397 (2015)","journal-title":"Finite Fields Appl."},{"key":"683_CR35","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF02418540","volume":"40","author":"J Hjelmslev","year":"1916","unstructured":"Hjelmslev, J.: The geometry of reality. Acta Math. 40, 35\u201366 (1916)","journal-title":"Acta Math."},{"key":"683_CR36","doi-asserted-by":"crossref","unstructured":"TByrne, E., Greferath, M., Kohnert, A., Skachek, V.: New bounds for codes over finite Frobenius rings. Des. Codes Cryptogr. 57, 169\u2013179 (2010)","DOI":"10.1007\/s10623-009-9359-y"},{"key":"683_CR37","unstructured":"Li, S., and Shi, M.:Characterization of Plotkin-optimal two-weight codes over finite chain rings and related applications. https:\/\/arxiv.org\/abs\/2305.08561 (2023)"},{"key":"683_CR38","doi-asserted-by":"publisher","first-page":"2550096","DOI":"10.1142\/S0219498825500963","volume":"24","author":"J Prabu","year":"2023","unstructured":"Prabu, J., Mahalakshmi, J., Santhakumar, S.: A class of t-weight codes and its applications. J. Algebr Appl. 24, 2550096 (2023)","journal-title":"J. Algebr Appl."},{"issue":"6","key":"683_CR39","doi-asserted-by":"publisher","first-page":"2089","DOI":"10.1109\/TIT.2005.847722","volume":"51","author":"C Carlet","year":"2005","unstructured":"Carlet, C., Ding, C., Yuan, J.: Linear codes from perfect nonlinear mappings and their secret sharing schemes. IEEE Trans. Inf. Theory 51(6), 2089\u20132102 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"683_CR40","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1147\/rd.45.0532","volume":"4","author":"JH Griesmer","year":"1960","unstructured":"Griesmer, J.H.: A bound for error-correcting codes. IBM J. Res. Develop. 4(5), 532\u2013542 (1960)","journal-title":"IBM J. Res. Develop."},{"key":"683_CR41","unstructured":"Massey, J.L.: Minimal codewords and secret sharing. In: Proceedings of the 6th joint Swedish-Russian international workshop on information theory. pp. 276\u2013279 (1993)"},{"key":"683_CR42","unstructured":"Massey, J.L.:,Some applications of coding theory in cryptography. Codes Ciphers Cryptogr. Coding IV. pp. 33\u201347 (1995)"},{"key":"683_CR43","doi-asserted-by":"crossref","unstructured":"Nimmy, K., Sankaran, S., Achuthan, K.: A novel multi-factor authentication protocol for smart home environments. In: International Conference on Information Systems Security. pp. 44\u201363 (2018)","DOI":"10.1007\/978-3-030-05171-6_3"},{"key":"683_CR44","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Managing Requirements Knowledge, International Workshop on. IEEE Computer Society. pp. 313\u2013313 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"2","key":"683_CR45","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1026421315292","volume":"15","author":"R Anderson","year":"1998","unstructured":"Anderson, R., Ding, C., Helleseth, T., Klove, T.: How to build robust shared control systems. Des. Codes Cryptogr. 15(2), 111\u2013124 (1998)","journal-title":"Des. Codes Cryptogr."},{"key":"683_CR46","first-page":"143","volume":"39","author":"AR Calderbank","year":"1984","unstructured":"Calderbank, A.R., Goethals, J.M.: Three-weight codes and association schemes. Philips J. Res. 39, 143\u2013152 (1984)","journal-title":"Philips J. Res."},{"key":"683_CR47","doi-asserted-by":"crossref","unstructured":"Beimel, A.:Secret-sharing schemes: a survey. In: International conference on coding and cryptology. pp.11\u201346 (2011)","DOI":"10.1007\/978-3-642-20901-7_2"},{"issue":"12","key":"683_CR48","doi-asserted-by":"publisher","first-page":"2366","DOI":"10.1587\/transfun.E101.A.2366","volume":"101","author":"G Xu","year":"2018","unstructured":"Xu, G., Cao, X., Gao, J., Luo, G.: Two classes of linear codes with two or three weights. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101(12), 2366\u20132373 (2018)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"5","key":"683_CR49","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s12095-016-0198-1","volume":"9","author":"X Wang","year":"2017","unstructured":"Wang, X., Gao, J., Fu, F.W.: Complete weight enumerators of two classes of linear codes. Cryptogr. Commun. 9(5), 545\u2013562 (2017)","journal-title":"Cryptogr. Commun."},{"issue":"05","key":"683_CR50","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1142\/S0129054116500180","volume":"27","author":"X Wang","year":"2016","unstructured":"Wang, X., Gao, J., Fu, F.W.: Secret sharing schemes from linear codes over $${\\mathbb{F} }_{p}+ v {\\mathbb{F} }_{p}$$. Int. J. Found. Comput. Sci. 27(05), 595\u2013605 (2016)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"11","key":"683_CR51","doi-asserted-by":"publisher","first-page":"5835","DOI":"10.1109\/TIT.2015.2473861","volume":"61","author":"K Ding","year":"2015","unstructured":"Ding, K., Ding, C.: A class of two-weight and three-weight codes and their applications in secret sharing. IEEE Trans. Inf. Theory. 61(11), 5835\u20135842 (2015)","journal-title":"IEEE Trans. Inf. Theory."},{"key":"683_CR52","doi-asserted-by":"crossref","unstructured":"Ding, C., Yuan, J.:Covering and secret sharing with linear codes. In: International Conference on Discrete Mathematics and Theoretical Computer Science. pp. 11\u201325. Springer (2013)","DOI":"10.1007\/3-540-45066-1_2"},{"issue":"1","key":"683_CR53","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2004.09.011","volume":"330","author":"C Ding","year":"2005","unstructured":"Ding, C., Wang, X.: A coding theory construction of new systematic authentication codes. Theor. Comp. Sci. 330(1), 81\u201399 (2005)","journal-title":"Theor. Comp. Sci."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-025-00683-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-025-00683-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-025-00683-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T07:46:50Z","timestamp":1779781610000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-025-00683-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,14]]},"references-count":53,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["683"],"URL":"https:\/\/doi.org\/10.1007\/s00200-025-00683-9","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,14]]},"assertion":[{"value":"28 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 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 no Conflict of interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interests"}}]}}