{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T12:14:04Z","timestamp":1773231244200,"version":"3.50.1"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T00:00:00Z","timestamp":1286236800000},"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":[[2011,10]]},"DOI":"10.1007\/s10623-010-9437-1","type":"journal-article","created":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T14:30:20Z","timestamp":1286202620000},"page":"31-40","source":"Crossref","is-referenced-by-count":25,"title":["Maximum distance separable codes over $${\\mathbb{Z}_4}$$ and $${\\mathbb{Z}_2 \\times \\mathbb{Z}_4}$$"],"prefix":"10.1007","volume":"61","author":[{"given":"M.","family":"Bilal","sequence":"first","affiliation":[]},{"given":"J.","family":"Borges","sequence":"additional","affiliation":[]},{"given":"S. T.","family":"Dougherty","sequence":"additional","affiliation":[]},{"given":"C.","family":"Fern\u00e1ndez-C\u00f3rdoba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,10,5]]},"reference":[{"key":"9437_CR1","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)."},{"issue":"2","key":"9437_CR2","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10623-009-9316-9","volume":"54","author":"J. Borges","year":"2010","unstructured":"Borges J., Fern\u00e1ndez-C\u00f3rdoba C., Pujol J., Rif\u00e0 J., Villanueva M.: $${\\mathbb Z_{2}\\mathbb Z_{4}}$$ -linear codes: generator matrices and duality. Des. Codes Cryptogr. 54(2), 167\u2013179 (2010)","journal-title":"Des. Codes Cryptogr."},{"key":"9437_CR3","unstructured":"Delsarte P.: An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl. 10, vi + 97 (1973)."},{"issue":"6","key":"9437_CR4","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":"9437_CR5","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1109\/18.904544","volume":"47","author":"S.T. Dougherty","year":"2001","unstructured":"Dougherty S.T., Shiromoto K.: Maximum distance codes over rings of order 4. IEEE Trans. Inform. Theory 47, 400\u2013404 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"9437_CR6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10623-009-9340-9","volume":"56","author":"C. Fern\u00e1ndez-C\u00f3rdoba","year":"2010","unstructured":"Fern\u00e1ndez-C\u00f3rdoba C., Pujol J., Villanueva M.: $${\\mathbb Z_{2}\\mathbb Z_{4}}$$ -linear codes: rank and kernel. Des. Codes Cryptogr. 56(1), 43\u201359 (2010)","journal-title":"Des. Codes Cryptogr."},{"key":"9437_CR7","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 Co., Amsterdam (1977)"},{"key":"9437_CR8","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"},{"key":"9437_CR9","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1109\/TIT.1964.1053661","volume":"10","author":"R.C. Singleton","year":"1964","unstructured":"Singleton R.C.: Maximum distance q-ary codes. IEEE Trans. Inform. Theory 10, 116\u2013118 (1964)","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-010-9437-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-010-9437-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9437-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:29Z","timestamp":1559246309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-010-9437-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,5]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9437"],"URL":"https:\/\/doi.org\/10.1007\/s10623-010-9437-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,5]]}}}