{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:51:33Z","timestamp":1761061893453,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,11,18]],"date-time":"2023-11-18T00:00:00Z","timestamp":1700265600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,11,18]],"date-time":"2023-11-18T00:00:00Z","timestamp":1700265600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["PID2019-104664GB-I00","PID2022-137924NB-I00","RED2022-134306-T (AEI \/ 10.13039\/501100011033)"],"award-info":[{"award-number":["PID2019-104664GB-I00","PID2022-137924NB-I00","RED2022-134306-T (AEI \/ 10.13039\/501100011033)"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Catalan AGAUR scholarship","award":["2020 FI SDUR 00475"],"award-info":[{"award-number":["2020 FI SDUR 00475"]}]},{"name":"Portuguese Foundation for Science and Technology (FCT-Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia), through CIDMA Center for Research and Development in Mathematics and Applications","award":["UIDB\/04106\/2020"],"award-info":[{"award-number":["UIDB\/04106\/2020"]}]},{"name":"Catalan AGAUR grant","award":["2021 SGR 00643"],"award-info":[{"award-number":["2021 SGR 00643"]}]},{"DOI":"10.13039\/501100011104","name":"Universitat Aut\u00f2noma de Barcelona","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100011104","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,4]]},"abstract":"Abstract<\/jats:title>Linear codes of length n<\/jats:italic> over $$\\mathbb {Z}_{p^s}$$<\/jats:tex-math>\n \n Z<\/mml:mi>\n \n p<\/mml:mi>\n s<\/mml:mi>\n <\/mml:msup>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, p<\/jats:italic> prime, called $$\\mathbb {Z}_{p^s}$$<\/jats:tex-math>\n \n Z<\/mml:mi>\n \n p<\/mml:mi>\n s<\/mml:mi>\n <\/mml:msup>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-additive codes, can be seen as subgroups of $$\\mathbb {Z}_{p^s}^n$$<\/jats:tex-math>\n \n Z<\/mml:mi>\n \n \n p<\/mml:mi>\n s<\/mml:mi>\n <\/mml:msup>\n <\/mml:mrow>\n n<\/mml:mi>\n <\/mml:msubsup>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. A $$\\mathbb {Z}_{p^s}$$<\/jats:tex-math>\n \n Z<\/mml:mi>\n \n p<\/mml:mi>\n s<\/mml:mi>\n <\/mml:msup>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-linear generalized Hadamard (GH) code is a GH code over $$\\mathbb {Z}_p$$<\/jats:tex-math>\n \n Z<\/mml:mi>\n p<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> which is the image of a $$\\mathbb {Z}_{p^s}$$<\/jats:tex-math>\n \n Z<\/mml:mi>\n \n p<\/mml:mi>\n s<\/mml:mi>\n <\/mml:msup>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-additive code under a generalized Gray map. It is known that the dimension of the kernel allows to classify these codes partially and to establish some lower and upper bounds on the number of such codes. Indeed, in this paper, for $$p\\ge 3$$<\/jats:tex-math>\n \n p<\/mml:mi>\n \u2265<\/mml:mo>\n 3<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> prime, we establish that some $$\\mathbb {Z}_{p^s}$$<\/jats:tex-math>\n \n Z<\/mml:mi>\n \n p<\/mml:mi>\n s<\/mml:mi>\n <\/mml:msup>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-linear GH codes of length $$p^t$$<\/jats:tex-math>\n \n p<\/mml:mi>\n t<\/mml:mi>\n <\/mml:msup>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> having the same dimension of the kernel are equivalent to each other, once t<\/jats:italic> is fixed. This allows us to improve the known upper bounds. Moreover, up to $$t=10$$<\/jats:tex-math>\n \n t<\/mml:mi>\n =<\/mml:mo>\n 10<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> if $$p=3$$<\/jats:tex-math>\n \n p<\/mml:mi>\n =<\/mml:mo>\n 3<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> or $$t=8$$<\/jats:tex-math>\n \n t<\/mml:mi>\n =<\/mml:mo>\n 8<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> if $$p=5$$<\/jats:tex-math>\n \n p<\/mml:mi>\n =<\/mml:mo>\n 5<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, this new upper bound coincides with a known lower bound based on the rank and dimension of the kernel.<\/jats:p>","DOI":"10.1007\/s10623-023-01325-2","type":"journal-article","created":{"date-parts":[[2023,11,18]],"date-time":"2023-11-18T13:02:57Z","timestamp":1700312577000},"page":"999-1022","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the equivalence of $$\\mathbb {Z}_{p^s}$$-linear generalized Hadamard codes"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4852-8739","authenticated-orcid":false,"given":"Dipak K.","family":"Bhunia","sequence":"first","affiliation":[]},{"given":"Cristina","family":"Fern\u00e1ndez-C\u00f3rdoba","sequence":"additional","affiliation":[]},{"given":"Carlos","family":"Vela","sequence":"additional","affiliation":[]},{"given":"Merc\u00e8","family":"Villanueva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,18]]},"reference":[{"key":"1325_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316529836","volume-title":"Designs and Their Codes","author":"EF Assmus","year":"1992","unstructured":"Assmus E.F., Key J.D.: Designs and Their Codes. Cambridge University Press, Cambridge (1992)."},{"issue":"1","key":"1325_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF02579339","volume":"3","author":"H Bauer","year":"1983","unstructured":"Bauer H., Ganter B., Hergert F.: Algebraic techniques for nonlinear codes. Combinatorica 3(1), 21\u201333 (1983).","journal-title":"Combinatorica"},{"key":"1325_CR3","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1007\/s10623-022-01026-2","volume":"90","author":"DK Bhunia","year":"2022","unstructured":"Bhunia D.K., Fern\u00e1ndez-C\u00f3rdoba C., Villanueva M.: On the linearity and classification of $$\\mathbb{Z} _{p^s}$$-linear generalized Hadamard codes. Des. Codes Cryptogr. 90, 1037\u20131058 (2022).","journal-title":"Des. Codes Cryptogr."},{"key":"1325_CR4","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/S1571-0653(04)00370-1","volume":"10","author":"J Borges","year":"2001","unstructured":"Borges J., Fern\u00e1ndez-C\u00f3rdoba C., Rif\u00e0 J.: Every $$\\mathbb{Z} _{2^k}$$-code is a binary propelinear code. Electron. Notes Discret. Math. 10, 100\u2013102 (2001).","journal-title":"Electron. Notes Discret. Math."},{"key":"1325_CR5","doi-asserted-by":"crossref","unstructured":"Butson A.T.: Generalized Hadamard matrices. Proc. Am. Math. Soc. 13, 894\u2013898 (1962).","DOI":"10.1090\/S0002-9939-1962-0142557-0"},{"issue":"4","key":"1325_CR6","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1214\/aoms\/1177729331","volume":"23","author":"RC Bose","year":"1952","unstructured":"Bose R.C., Bush K.A.: Orthogonal arrays of strength two and three. Ann. Math. Stat. 23(4), 508\u2013524 (1952).","journal-title":"Ann. Math. Stat."},{"key":"1325_CR7","unstructured":"Bosma W., Cannon J.J., Fieker C., Steel A.: Handbook of Magma functions. Edition 2.25 (2020). http:\/\/magma.maths.usyd.edu.au\/magma\/."},{"issue":"4","key":"1325_CR8","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1109\/18.681328","volume":"44","author":"C Carlet","year":"1998","unstructured":"Carlet C.: $$\\mathbb{Z} _{2^k}$$-linear codes. IEEE Trans. Inf. Theory 44(4), 1543\u20131547 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1325_CR9","doi-asserted-by":"publisher","first-page":"571","DOI":"10.3934\/amc.2011.5.571","volume":"5","author":"ST Dougherty","year":"2011","unstructured":"Dougherty S.T., Fern\u00e1ndez-C\u00f3rdoba C.: Codes over $$\\mathbb{Z} _{2^k}$$, Gray map and self-dual codes. Adv. Math. Commun. 5(4), 571\u2013588 (2011).","journal-title":"Adv. Math. Commun."},{"issue":"2","key":"1325_CR10","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1109\/TIT.2015.2509061","volume":"62","author":"ST Dougherty","year":"2016","unstructured":"Dougherty S.T., Rif\u00e0 J., Villanueva M.: Ranks and kernels of codes from generalized Hadamard matrices. IEEE Trans. Inf. Theory 62(2), 687\u2013694 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2\u20133","key":"1325_CR11","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10623-018-0546-6","volume":"87","author":"C Fern\u00e1ndez-C\u00f3rdoba","year":"2019","unstructured":"Fern\u00e1ndez-C\u00f3rdoba C., Vela C., Villanueva M.: On $$\\mathbb{Z} _{2^s}$$-linear Hadamard codes: kernel and partial classification. Des. Codes Cryptogr. 87(2\u20133), 417\u2013435 (2019).","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"1325_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2019.111721","volume":"343","author":"C Fern\u00e1ndez-C\u00f3rdoba","year":"2020","unstructured":"Fern\u00e1ndez-C\u00f3rdoba C., Vela C., Villanueva M.: Equivalences among $$\\mathbb{Z} _{2^s}$$-linear Hadamard codes. Discret. Math. 343(3), 111721 (2020).","journal-title":"Discret. Math."},{"issue":"7","key":"1325_CR13","doi-asserted-by":"publisher","first-page":"2522","DOI":"10.1109\/18.796395","volume":"45","author":"M Greferath","year":"1999","unstructured":"Greferath M., Schmidt S.E.: Gray isometries for finite chain rings and a nonlinear ternary $$(36,3^{12},15)$$ code. IEEE Trans. Inf. Theory 45(7), 2522\u20132524 (1999).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1325_CR14","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/18.312154","volume":"40","author":"AR Hammons","year":"1994","unstructured":"Hammons A.R., Kumar P.V., Calderbank A.R., Sloane N.J., Sol\u00e9 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":"1","key":"1325_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF01215243","volume":"167","author":"D Jungnickel","year":"1979","unstructured":"Jungnickel D.: On difference matrices, resolvable transversal designs and generalized Hadamard matrices. Math. Z. 167(1), 49\u201360 (1979).","journal-title":"Math. Z."},{"key":"1325_CR16","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S1571-0653(04)00161-1","volume":"6","author":"DS Krotov","year":"2001","unstructured":"Krotov D.S.: $$\\mathbb{Z} _4$$-linear Hadamard and extended perfect codes. Electron. Notes Discret. Math. 6, 107\u2013112 (2001).","journal-title":"Electron. Notes Discret. Math."},{"issue":"4","key":"1325_CR17","doi-asserted-by":"publisher","first-page":"1532","DOI":"10.1109\/TIT.2007.892787","volume":"53","author":"DS Krotov","year":"2007","unstructured":"Krotov D.S.: On $$\\mathbb{Z} _{2^k}$$-dual binary codes. IEEE Trans. Inf. Theory 53(4), 1532\u20131537 (2007).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1325_CR18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3317064","author":"X Li","year":"2023","unstructured":"Li X., Shi M., Wang S., Lu H., Zheng Y.: Rank and pairs of rank and dimension of kernel of $${\\mathbb{Z} } _p{\\mathbb{Z} } _{p^2}$$-linear codes. IEEE Trans. Inf. Theory (2023). https:\/\/doi.org\/10.1109\/TIT.2023.3317064.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1325_CR19","first-page":"18","volume":"35","author":"AA Nechaev","year":"1999","unstructured":"Nechaev A.A., Khonol\u2019d T.: Weighted modules and representations of codes. Problemy Peredachi Informatsii 35(3), 18\u201339 (1999).","journal-title":"Problemy Peredachi Informatsii"},{"issue":"2","key":"1325_CR20","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10623-004-3989-x","volume":"37","author":"KT Phelps","year":"2005","unstructured":"Phelps K.T., Rif\u00e0 J., Villanueva M.: Kernels and $$p$$-kernels of $$p^r$$-ary 1-perfect codes. Des. Codes Cryptogr. 37(2), 243\u2013261 (2005).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"1325_CR21","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1109\/TIT.2005.860464","volume":"52","author":"KT Phelps","year":"2006","unstructured":"Phelps K.T., Rif\u00e0 J., Villanueva M.: On the additive ($$\\mathbb{Z} _4$$-linear and non-$$\\mathbb{Z} _4$$-linear) Hadamard codes: rank and kernel. IEEE Trans. Inf. Theory 52(1), 316\u2013319 (2006).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1325_CR22","unstructured":"Pujol J., Villanueva M.: $$q$$-ary codes. A magma package, version 1.0. Universitat Aut\u00f2noma de Barcelona, Barcelona (2017). https:\/\/ccsg.uab.cat\/."},{"issue":"2","key":"1325_CR23","first-page":"84","volume":"4","author":"NV Semakov","year":"1968","unstructured":"Semakov N.V., Zinoviev V.A., Zaitsev V.G.: Class of maximal equidistant codes. Probl. Inf. Transm. 4(2), 84\u201387 (1968).","journal-title":"Probl. Inf. Transm."},{"issue":"6","key":"1325_CR24","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1007\/s10623-017-0390-0","volume":"86","author":"M Shi","year":"2018","unstructured":"Shi M., Sepasdar Z., Alahmadi A., Sol\u00e9 P.: On two-weight $$\\mathbb{Z} _{2^k}$$-codes. Des. Codes Cryptogr. 86(6), 1201\u20131209 (2018).","journal-title":"Des. Codes Cryptogr."},{"issue":"6","key":"1325_CR25","doi-asserted-by":"publisher","first-page":"3841","DOI":"10.1109\/TIT.2018.2883759","volume":"65","author":"M Shi","year":"2019","unstructured":"Shi M., Wu R., Krotov D.S.: On $$\\mathbb{Z} _p\\mathbb{Z} _{p^k}$$-additive codes and their duality. IEEE Trans. Inf. Theory 65(6), 3841\u20133847 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1325_CR26","doi-asserted-by":"publisher","first-page":"7769","DOI":"10.1109\/TIT.2021.3114636","volume":"67","author":"M Shi","year":"2021","unstructured":"Shi M., Honold T., Sol\u00e9 P., Qiu Y., Wu R., Sepasdar Z.: The geometry of two-weight codes over $$\\mathbb{Z} _{p^m}$$. IEEE Trans. Inf. Theory 67(12), 7769\u20137781 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1325_CR27","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1134\/S0032946022040032","volume":"58","author":"N Villanueva","year":"2022","unstructured":"Villanueva N., Zinoviev V.A., Zinoviev D.V.: On one construction method for Hadamard matrices. Probl. Inf. Transm. 58(4), 13\u201337 (2022).","journal-title":"Probl. Inf. Transm."},{"issue":"1","key":"1325_CR28","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1134\/S003294602101004X","volume":"57","author":"VA Zinoviev","year":"2021","unstructured":"Zinoviev V.A., Zinoviev D.V.: On the generalized concatenated construction for codes in $$l_1$$ and lee metrics. Probl. Inf. Transm. 57(1), 81\u201395 (2021).","journal-title":"Probl. Inf. Transm."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01325-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01325-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01325-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T18:08:07Z","timestamp":1713290887000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01325-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,18]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["1325"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01325-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2023,11,18]]},"assertion":[{"value":"13 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}