{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:07:40Z","timestamp":1775052460806,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1971,9,1]],"date-time":"1971-09-01T00:00:00Z","timestamp":52531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":15295,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1971,9]]},"DOI":"10.1016\/0097-3165(71)90043-4","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T23:49:18Z","timestamp":1107992958000},"page":"178-186","source":"Crossref","is-referenced-by-count":32,"title":["On the Golay perfect binary code"],"prefix":"10.1016","volume":"11","author":[{"given":"J.-M","family":"Goethals","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(71)90043-4_BIB1","article-title":"Steiner systems and perfect codes","author":"Assmus","year":"1966","journal-title":"University of North Carolina, Institute of Statistics Mimeo Series No. 484.1"},{"key":"10.1016\/0097-3165(71)90043-4_BIB2","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1090\/S0002-9904-1966-11582-3","article-title":"Disjoint systems associated with the Mathieu groups","volume":"72","author":"Assmus","year":"1966","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0097-3165(71)90043-4_BIB3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01899857","article-title":"Perfect codes and the Mathieu groups","volume":"17","author":"Assmus","year":"1966","journal-title":"Arch. Math. (Basel)"},{"key":"10.1016\/0097-3165(71)90043-4_BIB4","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0021-9800(67)80025-5","article-title":"On tactical configurations and error-correcting codes","volume":"2","author":"Assmus","year":"1967","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0097-3165(71)90043-4_BIB5","series-title":"Algebraic Coding Theory","author":"Berlekamp","year":"1968"},{"key":"10.1016\/0097-3165(71)90043-4_BIB6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1109\/TIT.1964.1053695","article-title":"On the minimal weight of binary group codes","author":"Calabi","year":"1964","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0097-3165(71)90043-4_BIB7","series-title":"Introduction to the Theory of Groups of Finite Order","author":"Carmichael","year":"1937"},{"key":"10.1016\/0097-3165(71)90043-4_BIB8","first-page":"398","article-title":"A perfect group of order 8,315,553,613,086,720,000 and the sporadic simple groups","volume":"61","author":"Conway","year":"1968"},{"key":"10.1016\/0097-3165(71)90043-4_BIB9","doi-asserted-by":"crossref","first-page":"597","DOI":"10.4153\/CJM-1970-067-9","article-title":"Strongly regular graphs derived from combinatorial designs","volume":"22","author":"Goethals","year":"1970","journal-title":"Canad. J. Math."},{"key":"10.1016\/0097-3165(71)90043-4_BIB10","first-page":"637","article-title":"Notes on digital coding","volume":"37","author":"Golay","year":"1949"},{"key":"10.1016\/0097-3165(71)90043-4_BIB11","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/BF01110435","article-title":"A simple group of order 44,353,000","volume":"105","author":"Higman","year":"1968","journal-title":"Math. Z."},{"key":"10.1016\/0097-3165(71)90043-4_BIB12","doi-asserted-by":"crossref","first-page":"761","DOI":"10.2307\/2373244","article-title":"On t-designs and groups","volume":"87","author":"Hughes","year":"1965","journal-title":"Amer. J. Math."},{"key":"10.1016\/0097-3165(71)90043-4_BIB13","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/j.1538-7305.1963.tb04003.x","article-title":"A theorem on the distribution of weights in a systematic code","volume":"42","author":"MacWilliams","year":"1963","journal-title":"Bell. System Tech. J."},{"key":"10.1016\/0097-3165(71)90043-4_BIB14","series-title":"Threshold Decoding","author":"Massey","year":"1963"},{"key":"10.1016\/0097-3165(71)90043-4_BIB15","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1016\/S0019-9958(67)90835-2","article-title":"An optimum nonlinear code","volume":"11","author":"Nordstrom","year":"1967","journal-title":"Information and Control"},{"key":"10.1016\/0097-3165(71)90043-4_BIB16","doi-asserted-by":"crossref","first-page":"15","DOI":"10.4153\/CJM-1957-003-8","article-title":"A note on the Mathieu groups","volume":"9","author":"Paige","year":"1957","journal-title":"Canad. J. Math."},{"key":"10.1016\/0097-3165(71)90043-4_BIB17","series-title":"Error-Correcting Codes","author":"Peterson","year":"1961"},{"key":"10.1016\/0097-3165(71)90043-4_BIB18","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0019-9958(63)90189-X","article-title":"Power moment identities on weight distributions in error-correcting codes","volume":"6","author":"Pless","year":"1963","journal-title":"Information and Control"},{"key":"10.1016\/0097-3165(71)90043-4_BIB19","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0021-9800(68)80067-5","article-title":"On the uniqueness of the Golay codes","volume":"5","author":"Pless","year":"1968","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0097-3165(71)90043-4_BIB20","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1016\/S0019-9958(68)90515-9","article-title":"Weight and distance structure of Nordstrom-Robinson quadratic code","volume":"12","author":"Preparata","year":"1968","journal-title":"Information and Control"},{"key":"10.1016\/0097-3165(71)90043-4_BIB21","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1109\/TIT.1970.1054480","article-title":"A new look at the Golay (23, 12) code","author":"Preparata","year":"1970","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0097-3165(71)90043-4_BIB22","series-title":"Proc. Hawaii Intern. Conf. System Sciences","first-page":"157","article-title":"Analysis of Nordstrom's optimum quadratic code","author":"Robinson","year":"1968"},{"key":"10.1016\/0097-3165(71)90043-4_BIB23_1","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/BF02948947","article-title":"Die 5-fach transitive Gruppen von Mathieu, \u00fcber Steinersche Systeme","volume":"12","author":"Witt","year":"1938","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/0097-3165(71)90043-4_BIB23_2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02948948","article-title":"Die 5-fach transitive Gruppen von Mathieu, \u00fcber Steinersche Systeme","volume":"12","author":"Witt","year":"1938","journal-title":"Abh. Math. Sem. Univ. Hamburg"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316571900434?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316571900434?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T04:25:30Z","timestamp":1548735930000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316571900434"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1971,9]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1971,9]]}},"alternative-id":["0097316571900434"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(71)90043-4","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1971,9]]}}}