{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T16:33:30Z","timestamp":1778949210519,"version":"3.51.4"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"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":6591,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1016\/0012-365x(94)00010-g","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"155-168","source":"Crossref","is-referenced-by-count":20,"title":["A coding theoretic approach to extending designs"],"prefix":"10.1016","volume":"142","author":[{"given":"George T.","family":"Kennedy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vera","family":"Pless","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00010-G_BIB1","first-page":"390","article-title":"Extending t-designs","volume":"12A","author":"Alltop","year":"1969","journal-title":"J. Combin Theory"},{"key":"10.1016\/0012-365X(94)00010-G_BIB2","series-title":"Combinatorics of Finite Sets","author":"Anderson","year":"1987"},{"key":"10.1016\/0012-365X(94)00010-G_BIB3","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1109\/TIT.1983.1056681","article-title":"On the covering radius of extremal self-dual codes","author":"Assmus","year":"1983","journal-title":"IEEE Trans. Inform. Theory IT-29"},{"key":"10.1016\/0012-365X(94)00010-G_BIB4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0097-3165(82)90039-5","article-title":"New uniqueness proofs for the (5, 8, 24), (5, 6, 12) and related Steiner systems","volume":"33A","author":"Bergstrand","year":"1982","journal-title":"J. Combin Theory"},{"key":"10.1016\/0012-365X(94)00010-G_BIB5","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0012-365X(92)90118-Y","article-title":"Orphan structure of the first order Reed-Muller codes","volume":"102","author":"Brualdi","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00010-G_BIB6","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/18.52488","article-title":"Orphans of the first order Reed-Muller codes","author":"Brualdi","year":"1990","journal-title":"IEEE Trans. Inform. Theory IT-36"},{"key":"10.1016\/0012-365X(94)00010-G_BIB7","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1109\/18.86979","article-title":"Weight enumerators of self-dual codes","author":"Brualdi","year":"1991","journal-title":"IEEE Trans. Inform. Theory IT-37"},{"key":"10.1016\/0012-365X(94)00010-G_BIB8","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/0097-3165(80)90057-6","article-title":"On the enumeration of self-dual codes","volume":"28A","author":"Conway","year":"1980","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(94)00010-G_BIB9","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1109\/18.59931","article-title":"New upper bounds on minimal distance of self-dual codes","author":"Conway","year":"1990","journal-title":"IEEE Trans. Inform. Theory IT-36"},{"key":"10.1016\/0012-365X(94)00010-G_BIB10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01388559","article-title":"On designs and formally self-dual codes","volume":"4","author":"Kennedy","year":"1994","journal-title":"Designs Codes Cryptography"},{"key":"10.1016\/0012-365X(94)00010-G_BIB11","series-title":"The Theory of Error-Correcting Codes Part I","author":"MacWilliams","year":"1977"},{"key":"10.1016\/0012-365X(94)00010-G_BIB12","first-page":"195","article-title":"Simple six designs exist","volume":"40","author":"Magliveras","year":"1983"},{"key":"10.1016\/0012-365X(94)00010-G_BIB13","series-title":"Introduction to the Theory of Error-Correcting Codes","author":"Pless","year":"1989"},{"key":"10.1016\/0012-365X(94)00010-G_BIB14","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1109\/TIT.1978.1055965","article-title":"Generalized quadratic residue codes","author":"van Lint","year":"1978","journal-title":"IEEE Trans. Inform. Theory IT-24"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400010G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400010G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:21:59Z","timestamp":1556130119000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9400010G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["0012365X9400010G"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00010-g","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}