{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T19:59:54Z","timestamp":1769975994150,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1999,5]]},"DOI":"10.1023\/a:1008335912135","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T09:41:38Z","timestamp":1040550098000},"page":"257-269","source":"Crossref","is-referenced-by-count":6,"title":["Construction of Extremal Type II Codes over \u21244"],"prefix":"10.1007","volume":"16","author":[{"given":"Philippe","family":"Gaborit","sequence":"first","affiliation":[]},{"given":"Masaaki","family":"Harada","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"199820_CR1","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1109\/18.370138","volume":"41","author":"A. Bonnecaze","year":"1995","unstructured":"A. Bonnecaze, P. Sol\u00e9 and A.R. Calderbank, Quaternary quadratic residue codes and unimodular lattices, IEEE Trans. Inform. Theory, Vol. 41 (1995) pp. 366-377.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"199820_CR2","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1109\/18.568705","volume":"43","author":"A. Bonnecaze","year":"1997","unstructured":"A. Bonnecaze, P. Sol\u00e9, C. Bachoc and B. Mourrain, Type II codes over \u21244, IEEE Trans. Inform. Theory, Vol. 43 (1997) pp. 969-976.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"199820_CR3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1109\/18.481791","volume":"42","author":"A. R. Calderbank","year":"1996","unstructured":"A. R. Calderbank, G. McGuire, P. V. Kumar and T. Helleseth, Cyclic codes over \u21244, locator polynomials, and Newton identities, IEEE Trans. Inform. Theory Vol. 42 (1996) pp. 217-226.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"199820_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1023\/A:1008639004036","volume":"6","author":"A. R. Calderbank","year":"1997","unstructured":"A. R. Calderbank and N. J. A. Sloane, Double circulant codes over \u21244 and even unimodular lattices, J. Alg. Combin., Vol. 6 (1997) pp. 119-131.","journal-title":"J. Alg. Combin."},{"key":"199820_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511623714","volume-title":"Designs, Graphs, Codes and Their Links","author":"P. J. Cameron","year":"1991","unstructured":"P. J. Cameron and J. H. van Lint, Designs, Graphs, Codes and Their Links, Cambridge University Press, Cambridge (1991)."},{"key":"199820_CR6","first-page":"369","volume":"8","author":"R. Chapman","year":"1996","unstructured":"R. Chapman and P. Sol\u00e9, Universal codes and unimodular lattices, J. de th. des nombres de Bordeaux, Vol. 8 (1996) pp. 369-376.","journal-title":"J. de th. des nombres de Bordeaux"},{"key":"199820_CR7","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/0097-3165(93)90070-O","volume":"62","author":"J. H. Conway","year":"1993","unstructured":"J. H. Conway and N. J. A. Sloane, Self-dual codes over the integers modulo 4, J. Combin. Theory Ser. A Vol. 62 (1993) pp. 30-45.","journal-title":"J. Combin. Theory Ser. A"},{"key":"199820_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2249-9","volume-title":"Sphere Packing, Lattices and Groups","author":"J. H. Conway","year":"1993","unstructured":"J. H. Conway and N. J. A. Sloane, Sphere Packing, Lattices and Groups (2nd ed.), Springer-Verlag, New York (1993).","edition":"2nd ed."},{"key":"199820_CR9","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/0097-3165(80)90057-6","volume":"28","author":"J. H. Conway","year":"1980","unstructured":"J. H. Conway and V. Pless, On the enumeration of self-dual codes, J. Combin. Theory Ser. A, Vol. 28 (1980) pp. 26-53.","journal-title":"J. Combin. Theory Ser. A"},{"key":"199820_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0097-3165(92)90003-D","volume":"60","author":"J. H. Conway","year":"1992","unstructured":"J. H. Conway, V. Pless and N. J. A. Sloane, The binary self-dual codes of length up to 32: a revised enumeration, J. Combin. Theory Ser. A, Vol. 60 (1992) pp. 183-195.","journal-title":"J. Combin. Theory Ser. A"},{"key":"199820_CR11","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1109\/18.651058","volume":"44","author":"J. Fields","year":"1998","unstructured":"J. Fields, P. Gaborit, J. Leon and V. Pless, All self-dual \u21244 codes of length 15 or less are known, IEEE Trans. Inform. Theory, Vol. 44 (1998) pp. 311-323.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"199820_CR12","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/18.508845","volume":"42","author":"P. Gaborit","year":"1996","unstructured":"P. Gaborit, Mass formulas for self-dual codes over \u21244 and \u2124q + uFq rings, IEEE Trans. Inform. Theory, Vol. 42 (1996) pp. 1222-1228.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"199820_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0012-365X(98)00035-1","volume":"194","author":"T. A. Gulliver","year":"1999","unstructured":"T. A. Gulliver and M. Harada, Extremal double circulant Type II codes over \u21244 and construction of 5-(24, 10, 36) designs, Discrete Math., Vol. 194 (1999) pp. 129-137.","journal-title":"Discrete Math."},{"key":"199820_CR14","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1023\/A:1008254008212","volume":"13","author":"M. Harada","year":"1998","unstructured":"M. Harada, New extremal Type II codes over \u21244, Des. Codes and Cryptogr., Vol. 13 (1998) pp. 271-284.","journal-title":"Des. Codes and Cryptogr."},{"key":"199820_CR15","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1002\/(SICI)1520-6610(1998)6:3<225::AID-JCD4>3.0.CO;2-H","volume":"6","author":"M. Harada","year":"1998","unstructured":"M. Harada, New 5-designs constructed from the lifted Golay code over \u21244, J. Combin. Designs, Vol. 6 (1998) pp. 225-229.","journal-title":"J. Combin. Designs"},{"key":"199820_CR16","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1109\/18.661525","volume":"44","author":"W.C. Huffman","year":"1998","unstructured":"W.C. Huffman, Decompositions and extremal Type II codes over \u21244, IEEE Trans. Inform. Theory, Vol. 44 (1998) pp. 800-809.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"199820_CR17","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1006\/jcta.1996.2750","volume":"78","author":"V. Pless","year":"1997","unstructured":"V. Pless, J. Leon and J. Fields, All \u21244 Type II codes of length 16 are known, J. Combin. Theory Ser. A, Vol. 78 (1997) pp. 32-50.","journal-title":"J. Combin. Theory Ser. A"},{"key":"199820_CR18","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1006\/ffta.1996.0172","volume":"3","author":"V. Pless","year":"1997","unstructured":"V. Pless, P. Sol\u00e9 and Z. Qian, Cyclic self-dual \u21244-codes, Finite Fields Their Appl., Vol. 3 (1997) pp. 48-69.","journal-title":"Finite Fields Their Appl."},{"key":"199820_CR19","unstructured":"E. Rains, private communication, November 4, 1997."},{"key":"199820_CR20","unstructured":"E. Rains, Optimal self-dual codes over \u21244, preprint, November 1997."},{"key":"199820_CR21","first-page":"25","volume":"19","author":"V.D. Tonchev","year":"1983","unstructured":"V.D. Tonchev, Block designs of Hadamard type and self-dual codes, Probl. Perda. Inform., Vol. 19 (1983) pp. 25-30 (in Russian). English translation in: Probl. Inform. Transm., Vol. 19 (1984) pp. 270\u2013275.","journal-title":"Probl. Perda. Inform."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008335912135.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008335912135\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008335912135.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:18:36Z","timestamp":1753759116000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008335912135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,5]]}},"alternative-id":["199820"],"URL":"https:\/\/doi.org\/10.1023\/a:1008335912135","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}