{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:46:44Z","timestamp":1761061604468,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100011033","name":"Agencia Estatal de Investigaci\u00f3n","doi-asserted-by":"publisher","award":["PID2019-104664GB-I00"],"award-info":[{"award-number":["PID2019-104664GB-I00"]}],"id":[{"id":"10.13039\/501100011033","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003030","name":"Ag\u00e8ncia de Gesti\u00f3 d\u2019Ajuts Universitaris i de Recerca","doi-asserted-by":"publisher","award":["2020 FI SDUR 00475"],"award-info":[{"award-number":["2020 FI SDUR 00475"]}],"id":[{"id":"10.13039\/501100003030","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p><jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathbb {Z}}_{p^s}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>Z<\/mml:mi>\n                    <mml:msup>\n                      <mml:mi>p<\/mml:mi>\n                      <mml:mi>s<\/mml:mi>\n                    <\/mml:msup>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-additive codes of length <jats:italic>n<\/jats:italic> are subgroups of <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathbb {Z}}_{p^s}^n$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msubsup>\n                    <mml:mi>Z<\/mml:mi>\n                    <mml:mrow>\n                      <mml:msup>\n                        <mml:mi>p<\/mml:mi>\n                        <mml:mi>s<\/mml:mi>\n                      <\/mml:msup>\n                    <\/mml:mrow>\n                    <mml:mi>n<\/mml:mi>\n                  <\/mml:msubsup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, and can be seen as a generalization of linear codes over <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathbb {Z}}_2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>Z<\/mml:mi>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathbb {Z}}_4$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>Z<\/mml:mi>\n                    <mml:mn>4<\/mml:mn>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, or <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathbb {Z}}_{2^s}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>Z<\/mml:mi>\n                    <mml:msup>\n                      <mml:mn>2<\/mml:mn>\n                      <mml:mi>s<\/mml:mi>\n                    <\/mml:msup>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> in general. A <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathbb {Z}}_{p^s}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>Z<\/mml:mi>\n                    <mml:msup>\n                      <mml:mi>p<\/mml:mi>\n                      <mml:mi>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 <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathbb {Z}}_p$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>Z<\/mml:mi>\n                    <mml:mi>p<\/mml:mi>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> which is the image of a <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathbb {Z}}_{p^s}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>Z<\/mml:mi>\n                    <mml:msup>\n                      <mml:mi>p<\/mml:mi>\n                      <mml:mi>s<\/mml:mi>\n                    <\/mml:msup>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-additive code by a generalized Gray map. In this paper, we generalize some known results for <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathbb {Z}}_{p^s}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>Z<\/mml:mi>\n                    <mml:msup>\n                      <mml:mi>p<\/mml:mi>\n                      <mml:mi>s<\/mml:mi>\n                    <\/mml:msup>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-linear GH codes with <jats:inline-formula><jats:alternatives><jats:tex-math>$$p=2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> to any odd prime <jats:italic>p<\/jats:italic>. First, we show some results related to the generalized Carlet\u2019s Gray map. Then, by using an iterative construction of <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathbb {Z}}_{p^s}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>Z<\/mml:mi>\n                    <mml:msup>\n                      <mml:mi>p<\/mml:mi>\n                      <mml:mi>s<\/mml:mi>\n                    <\/mml:msup>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-additive GH codes of type <jats:inline-formula><jats:alternatives><jats:tex-math>$$(n;t_1,\\ldots , t_s)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>n<\/mml:mi>\n                    <mml:mo>\u037e<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>t<\/mml:mi>\n                      <mml:mn>1<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mo>\u2026<\/mml:mo>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>t<\/mml:mi>\n                      <mml:mi>s<\/mml:mi>\n                    <\/mml:msub>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, we show for which types the corresponding <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathbb {Z}}_{p^s}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>Z<\/mml:mi>\n                    <mml:msup>\n                      <mml:mi>p<\/mml:mi>\n                      <mml:mi>s<\/mml:mi>\n                    <\/mml:msup>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-linear GH codes of length <jats:inline-formula><jats:alternatives><jats:tex-math>$$p^t$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mi>t<\/mml:mi>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> are nonlinear over <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathbb {Z}}_p$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>Z<\/mml:mi>\n                    <mml:mi>p<\/mml:mi>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. For these codes, we compute the kernel and its dimension, which allow us to give a partial classification. The obtained results for <jats:inline-formula><jats:alternatives><jats:tex-math>$$p\\ge 3$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mo>\u2265<\/mml:mo>\n                    <mml:mn>3<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> are different from the case with <jats:inline-formula><jats:alternatives><jats:tex-math>$$p=2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. Finally, the exact number of non-equivalent such codes is given for an infinite number of values of <jats:italic>s<\/jats:italic>, <jats:italic>t<\/jats:italic>, and any <jats:inline-formula><jats:alternatives><jats:tex-math>$$p\\ge 2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mo>\u2265<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>; by using also the rank as an invariant in some specific cases.<\/jats:p>","DOI":"10.1007\/s10623-022-01026-2","type":"journal-article","created":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T12:06:52Z","timestamp":1647259612000},"page":"1037-1058","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["On the linearity and classification of $${\\mathbb {Z}}_{p^s}$$-linear generalized hadamard codes"],"prefix":"10.1007","volume":"90","author":[{"given":"Dipak K.","family":"Bhunia","sequence":"first","affiliation":[]},{"given":"Cristina","family":"Fern\u00e1ndez-C\u00f3rdoba","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6179-0833","authenticated-orcid":false,"given":"Merc\u00e8","family":"Villanueva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,14]]},"reference":[{"key":"1026_CR1","unstructured":"Armario, J.A., Bailera, I., Egan, R.: Butson full propelinear codes. preprint arXiv:2010.06206 (2020)"},{"key":"1026_CR2","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":"1026_CR3","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"},{"issue":"4","key":"1026_CR4","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S0019-9958(75)80001-5","volume":"29","author":"IF Blake","year":"1975","unstructured":"Blake I.F.: Codes over integer residue rings. Information and Control 29(4), 295\u2013300 (1975).","journal-title":"Information and Control"},{"key":"1026_CR5","doi-asserted-by":"crossref","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).","DOI":"10.1016\/S1571-0653(04)00370-1"},{"key":"1026_CR6","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":"1026_CR7","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":"3","key":"1026_CR8","first-page":"22","volume":"33","author":"I Constantinescu","year":"1997","unstructured":"Constantinescu I., Heise W.: A metric for codes over residue class rings. Problemy Peredachi Informatsii 33(3), 22\u201328 (1997).","journal-title":"Problemy Peredachi Informatsii"},{"issue":"4","key":"1026_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":"1026_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":"1026_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."},{"key":"1026_CR12","doi-asserted-by":"crossref","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).","DOI":"10.1016\/j.disc.2019.111721"},{"issue":"7","key":"1026_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,312,15)$$ code. IEEE Trans. Inf. Theory 45(7), 2522\u20132524 (1999).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1026_CR14","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10623-004-1717-1","volume":"36","author":"MK Gupta","year":"2005","unstructured":"Gupta M.K., Bhandari M.C., Lal A.K.: On linear codes over $${\\mathbb{Z}}_{2^s}$$. Des. Codes Cryptogr. 36(3), 227\u2013244 (2005).","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"1026_CR15","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":"3","key":"1026_CR16","first-page":"205","volume":"35","author":"T Honold","year":"1999","unstructured":"Honold T., Nechaev A.A.: Weighted modules and representations of codes. Probl. Inf. Transm. 35(3), 205\u2013223 (1999).","journal-title":"Probl. Inf. Transm."},{"issue":"1","key":"1026_CR17","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":"1026_CR18","doi-asserted-by":"crossref","unstructured":"Krotov D.S.: $${\\mathbb{Z}}_4$$-linear Hadamard and extended perfect codes. Electron. Notes Discret Math. 6, 107\u2013112 (2001).","DOI":"10.1016\/S1571-0653(04)00161-1"},{"issue":"4","key":"1026_CR19","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"},{"issue":"2","key":"1026_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":"1026_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"},{"issue":"4","key":"1026_CR22","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1109\/TIT.1979.1056063","volume":"25","author":"P Shankar","year":"1979","unstructured":"Shankar P.: On BCH codes over arbitrary integer rings. IEEE Trans. Inf. Theory 25(4), 480\u2013483 (1979).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1026_CR23","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":"6","key":"1026_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":"1026_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"},{"key":"1026_CR26","doi-asserted-by":"crossref","unstructured":"Tapia-Recillas H., Vega G.: On $${\\mathbb{Z}}_{2^k}$$-linear and quaternary codes. SIAM J. Discret Math. 17(1), 103\u2013113 (2003).","DOI":"10.1137\/S0895480101397219"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01026-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01026-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01026-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T17:16:23Z","timestamp":1658164583000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01026-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,14]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["1026"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01026-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,3,14]]},"assertion":[{"value":"22 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}