{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T19:55:57Z","timestamp":1760385357676},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,4,12]],"date-time":"2014-04-12T00:00:00Z","timestamp":1397260800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s10623-014-9963-3","type":"journal-article","created":{"date-parts":[[2014,4,11]],"date-time":"2014-04-11T20:43:14Z","timestamp":1397248994000},"page":"373-384","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On a 5-design related to a putative extremal doubly even self-dual code of length a multiple of 24"],"prefix":"10.1007","volume":"76","author":[{"given":"Masaaki","family":"Harada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,12]]},"reference":[{"key":"9963_CR1","doi-asserted-by":"crossref","unstructured":"Assmus Jr. E.F., Key J.D.: Designs and Their Codes. Cambridge Tracts in Mathematics, vol. 103. Cambridge University Press, Cambridge (1992).","DOI":"10.1017\/CBO9781316529836"},{"key":"9963_CR2","doi-asserted-by":"crossref","unstructured":"Assmus Jr. E.F., Mattson Jr. H.F.: New 5-designs. J. Comb. Theory 6, 122\u2013151 (1969).","DOI":"10.1016\/S0021-9800(69)80115-8"},{"key":"9963_CR3","doi-asserted-by":"crossref","unstructured":"Conway J.H., Sloane N.J.A.: A new upper bound on the minimal distance of self-dual codes. IEEE Trans. Inf. Theory 36, 1319\u20131333 (1990).","DOI":"10.1109\/18.59931"},{"key":"9963_CR4","unstructured":"Cruz J., Willems W.: 5-designs related to binary extremal self-dual codes of length 24m. Theory and applications of finite fields. In: Contemporary Mathematics, vol. 579, pp. 75\u201380. American Mathematical Society, Providence (2012)."},{"key":"9963_CR5","doi-asserted-by":"crossref","unstructured":"Harada M.: Remark on a 5-design related to a putative extremal doubly-even self-dual [96,48,20] code. Des. Codes Cryptogr. 37, 355\u2013358 (2005).","DOI":"10.1007\/s10623-004-3997-x"},{"key":"9963_CR6","doi-asserted-by":"crossref","unstructured":"Harada M., Kitazume M., Munemasa A.: On a 5-design related to an extremal doubly even self-dual code of length 72. J. Comb. Theory Ser. A 107, 143\u2013146 (2004).","DOI":"10.1016\/j.jcta.2004.03.005"},{"key":"9963_CR7","unstructured":"Harada M., Miezaki T., Munemasa A.: On t-designs supported by self-orthogonal codes (in preparation)."},{"key":"9963_CR8","doi-asserted-by":"crossref","unstructured":"Harada M., Munemasa A., Tonchev V.D.: A characterization of designs related to an extremal doubly-even self-dual code of length 48. Ann. Comb. 5, 189\u2013198 (2005).","DOI":"10.1007\/s00026-005-0250-x"},{"key":"9963_CR9","doi-asserted-by":"crossref","unstructured":"MacWilliams F.J., Sloane N.J.A., Thompson J.G.: Good self dual codes exist. Discret. Math. 3, 153\u2013162 (1972).","DOI":"10.1016\/0012-365X(72)90030-1"},{"key":"9963_CR10","doi-asserted-by":"crossref","unstructured":"Mallows C.L., Sloane N.J.A.: An upper bound for self-dual codes. Inf. Control 22, 188\u2013200 (1973).","DOI":"10.1016\/S0019-9958(73)90273-8"},{"key":"9963_CR11","unstructured":"Mendelsohn N.S.: Intersection numbers of t-designs, In: Studies in Pure Mathematics (presented to Richard Rado), pp. 145\u2013150. Academic Press, London (1971)."},{"key":"9963_CR12","doi-asserted-by":"crossref","unstructured":"Sloane N.J.A.: Is there a (72,36) $$d=16$$ d = 16 self-dual code? IEEE Trans. Inf. Theory 19, 251 (1973).","DOI":"10.1109\/TIT.1973.1054975"},{"key":"9963_CR13","doi-asserted-by":"crossref","unstructured":"Tonchev V.D.: A characterization of designs related to the Witt system S(5,8,24). Math. Z. 191, 225\u2013230 (1986).","DOI":"10.1007\/BF01164026"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-9963-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-014-9963-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-9963-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:39Z","timestamp":1559246319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-014-9963-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,12]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["9963"],"URL":"https:\/\/doi.org\/10.1007\/s10623-014-9963-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,12]]}}}