{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T11:58:09Z","timestamp":1772279889482,"version":"3.50.1"},"reference-count":44,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1975,5,1]],"date-time":"1975-05-01T00:00:00Z","timestamp":168134400000},"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":13957,"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":[[1975,5]]},"DOI":"10.1016\/0097-3165(75)90042-4","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T15:09:06Z","timestamp":1096988946000},"page":"313-335","source":"Crossref","is-referenced-by-count":130,"title":["On the classification and enumeration of self-dual codes"],"prefix":"10.1016","volume":"18","author":[{"given":"Vera","family":"Pless","sequence":"first","affiliation":[]},{"given":"N.J.A","family":"Sloane","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(75)90042-4_BIB1","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."},{"key":"10.1016\/0097-3165(75)90042-4_BIB2","series-title":"Algebraic Coding Theory","author":"Berlekamp","year":"1968"},{"key":"10.1016\/0097-3165(75)90042-4_BIB3","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/S0019-9958(71)90295-6","article-title":"Coding theory and the Mathieu groups","volume":"18","author":"Berlekamp","year":"1971","journal-title":"Info. Control"},{"key":"10.1016\/0097-3165(75)90042-4_BIB4","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1109\/TIT.1972.1054817","article-title":"Gleason's theorem on self-dual codes","volume":"18","author":"Berlekamp","year":"1972","journal-title":"IEEE Trans. Info. Theory"},{"key":"10.1016\/0097-3165(75)90042-4_BIB5","series-title":"ALTRAN User's Manual","author":"Brown","year":"1974"},{"key":"10.1016\/0097-3165(75)90042-4_BIB6","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0095-8956(71)90029-3","article-title":"The M\u00f6bius function and connected graphs","volume":"11","author":"Cadogan","year":"1971","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"10.1016\/0097-3165(75)90042-4_BIB7","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(75)90042-4_BIB8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1112\/blms\/1.1.79","article-title":"A group of order 8, 315, 553, 613, 086, 720, 000","volume":"1","author":"Conway","year":"1969","journal-title":"Bull. London Math. Soc."},{"key":"10.1016\/0097-3165(75)90042-4_BIB9","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01389796","article-title":"A characterization of Leech's lattice","volume":"7","author":"Conway","year":"1969","journal-title":"Inventiones Math."},{"key":"10.1016\/0097-3165(75)90042-4_BIB10","series-title":"Finite Simple Groups","first-page":"215","article-title":"Three lectures on exceptional groups","author":"Conway","year":"1971"},{"key":"10.1016\/0097-3165(75)90042-4_BIB11","first-page":"122","article-title":"Combinatorial problems in the theory of graphs, I","volume":"42","author":"Ford","year":"1956"},{"key":"10.1016\/0097-3165(75)90042-4_BIB12","doi-asserted-by":"crossref","first-page":"405","DOI":"10.4153\/CJM-1956-046-2","article-title":"Enumeration of labeled graphs","volume":"8","author":"Gilbert","year":"1956","journal-title":"Canad. J. Math."},{"key":"10.1016\/0097-3165(75)90042-4_BIB13","first-page":"211","article-title":"Weight polynomials of self-dual codes and the MacWilliams identities","volume":"Vol. 3","author":"Gleason","year":"1970"},{"key":"10.1016\/0097-3165(75)90042-4_BIB14","unstructured":"J. M. Goethals, F. J. MacWilliams, and C. L. Mallows, Further remarks on extremal self-dual codes, to appear."},{"key":"10.1016\/0097-3165(75)90042-4_BIB15","first-page":"657","article-title":"Notes on digital coding","volume":"37","author":"Golay","year":"1949"},{"key":"10.1016\/0097-3165(75)90042-4_BIB16","first-page":"23","article-title":"Binary coding","volume":"4","author":"Golay","year":"1954","journal-title":"IEEE Trans. Info. Theory"},{"key":"10.1016\/0097-3165(75)90042-4_BIB17","first-page":"517","article-title":"The ALTRAN system for rational function manipulation\u2014a survey","volume":"14","author":"Hall","year":"1971","journal-title":"Commun. Assoc. Computing Machinery"},{"key":"10.1016\/0097-3165(75)90042-4_BIB18","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/TIT.1973.1055009","article-title":"Minimum-distance bounds for binary linear codes","volume":"19","author":"Helgert","year":"1973","journal-title":"IEEE Trans. Info. Theory"},{"key":"10.1016\/0097-3165(75)90042-4_BIB19","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/TIT.1969.1054261","article-title":"New binary coding results by circulants","volume":"15","author":"Karlin","year":"1969","journal-title":"IEEE Trans. Info. Theory"},{"key":"10.1016\/0097-3165(75)90042-4_BIB20","first-page":"155","volume":"Vol. 1","author":"Kendall","year":"1969"},{"key":"10.1016\/0097-3165(75)90042-4_BIB21","doi-asserted-by":"crossref","first-page":"657","DOI":"10.4153\/CJM-1964-065-1","article-title":"Some sphere packings in higher space","volume":"16","author":"Leech","year":"1964","journal-title":"Canad. J. Math."},{"key":"10.1016\/0097-3165(75)90042-4_BIB22","doi-asserted-by":"crossref","first-page":"718","DOI":"10.4153\/CJM-1971-081-3","article-title":"Sphere packings and error-connecting codes","volume":"23","author":"Leech","year":"1971","journal-title":"Canad. J. Math."},{"key":"10.1016\/0097-3165(75)90042-4_BIB23","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1109\/TIT.1972.1054898","article-title":"Generalizations of Gleason's theorem on weight enumerators of self-dual codes","volume":"18","author":"MacWilliams","year":"1972","journal-title":"IEEE Trans. Info. Theory"},{"key":"10.1016\/0097-3165(75)90042-4_BIB24","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0012-365X(72)90030-1","article-title":"Good self dual codes exist","volume":"3","author":"MacWilliams","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/0097-3165(75)90042-4_BIB25","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/S0019-9958(73)90273-8","article-title":"An upper bound for self-dual codes","volume":"22","author":"Mallows","year":"1973","journal-title":"Info. Control"},{"key":"10.1016\/0097-3165(75)90042-4_BIB26","series-title":"Proc. Second A.C.M. Symposium on Symbolic and Algebraic Manipulation","article-title":"The MACSYMA system","author":"Martin","year":"1971"},{"key":"10.1016\/0097-3165(75)90042-4_BIB27","series-title":"MACSYMA Reference Manual","author":"Project MAC","year":"1973"},{"key":"10.1016\/0097-3165(75)90042-4_BIB28","series-title":"Symmetric Bilinear Forms","author":"Milnor","year":"1973"},{"key":"10.1016\/0097-3165(75)90042-4_BIB29","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0022-314X(73)90068-1","article-title":"Definite quadratische Formen der Dimension 24 und Diskriminante 1","volume":"5","author":"Niemeier","year":"1973","journal-title":"J. Number Theory"},{"key":"10.1016\/0097-3165(75)90042-4_BIB30","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(75)90042-4_BIB31","series-title":"Error-Connecting Codes","author":"Peterson","year":"1972"},{"key":"10.1016\/0097-3165(75)90042-4_BIB32","first-page":"418","article-title":"The number of isotropic subspaces in a finite geometry","volume":"39","author":"Vera","year":"1965","journal-title":"Accad. Naz. Lincei., Rend. Cl. Sci. Fiz., Mat. e Nat. (8)"},{"key":"10.1016\/0097-3165(75)90042-4_BIB33","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(75)90042-4_BIB34","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0012-365X(72)90034-9","article-title":"A classification of self-orthogonal codes over GF(2)","volume":"3","author":"Pless","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/0097-3165(75)90042-4_BIB35","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0019-9958(73)90862-0","article-title":"Self-dual codes over GF(q) satisfy a modified Varshamov bound","volume":"23","author":"Pless","year":"1973","journal-title":"Information and Control"},{"key":"10.1016\/0097-3165(75)90042-4_BIB36","series-title":"An Introduction to Combinatorial Analysis","author":"Riordan","year":"1958"},{"key":"10.1016\/0097-3165(75)90042-4_BIB37","series-title":"Combinatorial Identities","author":"Riordan","year":"1968"},{"key":"10.1016\/0097-3165(75)90042-4_BIB38_1","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1002\/j.1538-7305.1960.tb03958.x","article-title":"Some further theory of group codes","volume":"39","author":"Slepian","year":"1960","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/0097-3165(75)90042-4_BIB38_2","article-title":"Algebraic Coding Theory: History and Development","author":"Slepian","year":"1973"},{"key":"10.1016\/0097-3165(75)90042-4_BIB39","article-title":"The uniqueness of the Nordstrom-Robinson and Golay binary codes","author":"Snover","year":"1973"},{"key":"10.1016\/0097-3165(75)90042-4_BIB40","doi-asserted-by":"crossref","first-page":"164","DOI":"10.4153\/CJM-1951-021-6","article-title":"The Mathieu groups","volume":"3","author":"Stanton","year":"1951","journal-title":"Canad. J. Math."},{"key":"10.1016\/0097-3165(75)90042-4_BIB41","series-title":"UNIX Programmer's Manual","author":"Thompson","year":"1972"},{"key":"10.1016\/0097-3165(75)90042-4_BIB42","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF02413742","article-title":"A representation of the Mathieu group M24 as a collineation group","volume":"71","author":"Todd","year":"1966","journal-title":"Ann. di Math. Pura ed Appl., (IV)"},{"key":"10.1016\/0097-3165(75)90042-4_BIB43","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02948948","article-title":"\u00dcber 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:0097316575900424?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316575900424?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T07:30:54Z","timestamp":1549179054000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316575900424"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,5]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1975,5]]}},"alternative-id":["0097316575900424"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(75)90042-4","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1975,5]]}}}