{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T18:20:49Z","timestamp":1773253249184,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,8,1]],"date-time":"2009-08-01T00:00:00Z","timestamp":1249084800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2010,2]]},"DOI":"10.1007\/s10623-009-9316-9","type":"journal-article","created":{"date-parts":[[2009,7,31]],"date-time":"2009-07-31T02:59:49Z","timestamp":1249009189000},"page":"167-179","source":"Crossref","is-referenced-by-count":137,"title":["$${{{\\mathbb Z}_2}{{\\mathbb Z}_4}}$$ -linear codes: generator matrices and duality"],"prefix":"10.1007","volume":"54","author":[{"given":"J.","family":"Borges","sequence":"first","affiliation":[]},{"given":"C.","family":"Fern\u00e1ndez-C\u00f3rdoba","sequence":"additional","affiliation":[]},{"given":"J.","family":"Pujol","sequence":"additional","affiliation":[]},{"given":"J.","family":"Rif\u00e0","sequence":"additional","affiliation":[]},{"given":"M.","family":"Villanueva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,1]]},"reference":[{"key":"9316_CR1","volume-title":"Introduction to Coding Theory","author":"J. Bierbrauer","year":"2005","unstructured":"Bierbrauer J.: Introduction to Coding Theory. Chapman & Hall\/CRC, Boca Raton, FL (2005)"},{"issue":"7","key":"9316_CR2","doi-asserted-by":"crossref","first-page":"2686","DOI":"10.1109\/TIT.2005.850148","volume":"51","author":"J. Borges","year":"2005","unstructured":"Borges J., Fern\u00e1ndez C., Phelps K.T.: Quaternary Reed\u2013Muller codes. IEEE Trans. Inform. Theory 51(7), 2686\u20132691 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"9316_CR3","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1109\/TIT.2007.911211","volume":"54","author":"J. Borges","year":"2008","unstructured":"Borges J., Fern\u00e1ndez-C\u00f3rdoba C., Phelps K.T.: ZRM codes. IEEE Trans. Inform. Theory 54(1), 380\u2013386 (2008)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9316_CR4","unstructured":"Borges J., Fern\u00e1ndez C., Pujol J., Rif\u00e0 J., Villanueva M.: On $${{{\\mathbb Z}_2}{{\\mathbb Z}_4}}$$ -linear codes and duality. VJMDA, pp. 171\u2013177, Ciencias, 23. Secr. Publ. Intercamb. Ed., Valladolid (2006)."},{"key":"9316_CR5","unstructured":"Borges J., Fern\u00e1ndez-C\u00f3rdoba C., Pujol J., Rif\u00e0 J., Villanueva M.: $${{{\\mathbb Z}_2}{{\\mathbb Z}_4}}$$ -Additive Codes. A Magma Package. Autonomous University of Barcelona (UAB), Bellaterra, Barcelona (2007). http:\/\/www.ccg.uab.cat . Accessed July 2009."},{"key":"9316_CR6","unstructured":"Borges J., Fern\u00e1ndez C., Rif\u00e0 J.: Every $${{\\mathbb Z}_{2k}}$$ -code is a binary propelinear code. In: COMB\u201901. Electronic Notes in Discrete Mathematics, vol. 10, pp. 100\u2013102. Elsevier Science, Amsterdam, November (2001)."},{"issue":"8","key":"9316_CR7","doi-asserted-by":"crossref","first-page":"2028","DOI":"10.1109\/TIT.2003.814490","volume":"49","author":"J. Borges","year":"2003","unstructured":"Borges J., Phelps K.T., Rif\u00e0 J.: The rank and kernel of extended 1-perfect $${{\\mathbb Z}_4}$$ -linear and additive non- $${{\\mathbb Z}_4}$$ -linear codes. IEEE Trans. Inform. Theory 49(8), 2028\u20132034 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"9316_CR8","doi-asserted-by":"crossref","first-page":"1688","DOI":"10.1109\/18.771247","volume":"45","author":"J. Borges","year":"1999","unstructured":"Borges J., Rif\u00e0 J.: A characterization of 1-perfect additive codes. IEEE Trans. Inform. Theory 45(5), 1688\u20131697 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3\u20134","key":"9316_CR9","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W. Bosma","year":"1997","unstructured":"Bosma W., Cannon J., Playoust C.: The MAGMA algebra system I: the user language. J. Symb. Comput. 24(3\u20134), 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"key":"9316_CR10","unstructured":"Delsarte P.: An algebraic approach to the association schemes of coding theory. Philips Research Rep. Suppl. 10, vi\u00a0+\u00a097 (1973)."},{"issue":"6","key":"9316_CR11","doi-asserted-by":"crossref","first-page":"2477","DOI":"10.1109\/18.720545","volume":"44","author":"P. Delsarte","year":"1998","unstructured":"Delsarte P., Levenshtein V.: Association schemes and coding theory. IEEE Trans. Inform. Theory 44(6), 2477\u20132504 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9316_CR12","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/18.312154","volume":"40","author":"A.R. Hammons","year":"1994","unstructured":"Hammons A.R., Kumar P.V., Calderbank A.R., Sloane N.J.A., Sol\u00e9 P.: The $${{\\mathbb Z}_4}$$ -linearity of kerdock, preparata, goethals and related codes. IEEE Trans. Inform. Theory 40, 301\u2013319 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9316_CR13","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/S0019-9958(77)90372-2","volume":"34","author":"O. Heden","year":"1977","unstructured":"Heden O.: A new construction of group and nongroup perfect codes. Inform. Control 34, 314\u2013323 (1977)","journal-title":"Inform. Control"},{"key":"9316_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"W.C. Huffman","year":"2003","unstructured":"Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)"},{"key":"9316_CR15","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S1571-0653(04)00161-1","volume":"6","author":"D.S. Krotov","year":"2001","unstructured":"Krotov D.S.: $${{\\mathbb Z}_4}$$ -linear Hadamard and extended perfect codes. Electron. Notes Discrete Math. 6, 107\u2013112 (2001)","journal-title":"Electron. Notes Discrete Math."},{"key":"9316_CR16","volume-title":"Introduction to Group Characters","author":"W. Ledermann","year":"1977","unstructured":"Ledermann W.: Introduction to Group Characters. Cambridge University Press, Cambridge (1977)"},{"key":"9316_CR17","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4153\/CMB-1975-011-2","volume":"18","author":"B. Lindstr\u00f6m","year":"1975","unstructured":"Lindstr\u00f6m B.: Group partitions and mixed perfect codes. Can. Math. Bull. 18, 57\u201360 (1975)","journal-title":"Can. Math. Bull."},{"key":"9316_CR18","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland Publishing Company, Amsterdam, New York, Oxford (1977)"},{"issue":"1","key":"9316_CR19","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1109\/TIT.2005.860464","volume":"52","author":"K.T. 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. Inform. Theory 52(1), 316\u2013319 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9316_CR20","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1109\/18.556115","volume":"43","author":"J. Pujol","year":"1997","unstructured":"Pujol J., Rif\u00e0 J.: Translation invariant propelinear codes. IEEE Trans. Inform. Theory 43, 590\u2013598 (1997)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"9316_CR21","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/TIT.2008.2008143","volume":"55","author":"J. Pujol","year":"2009","unstructured":"Pujol J., Rif\u00e0 J., Solov\u2019eva F.: Construction of $${{\\mathbb Z}_4}$$ -linear Reed\u2013Muller codes. IEEE Trans. Inform. Theory 55(1), 99\u2013104 (2009)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9316_CR22","doi-asserted-by":"crossref","unstructured":"Rif\u00e0 J., Basart J.M., Huguet L.: On completely regular propelinear codes. In: Proceedings of 6th International Conference, AAECC-6. LNCS, vol. 357, pp. 341\u2013355. Springer, Berlin (1989).","DOI":"10.1007\/3-540-51083-4_71"},{"issue":"9","key":"9316_CR23","doi-asserted-by":"crossref","first-page":"2587","DOI":"10.1109\/TIT.2002.801474","volume":"48","author":"J. Rifa","year":"2002","unstructured":"Rifa J., Phelps K.T.: On binary 1-perfect additive codes: some structural properties. IEEE Trans. Inform. Theory 48(9), 2587\u20132592 (2002)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9316-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-009-9316-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9316-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:26Z","timestamp":1559231906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-009-9316-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,1]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["9316"],"URL":"https:\/\/doi.org\/10.1007\/s10623-009-9316-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,1]]}}}