{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T16:39:51Z","timestamp":1648917591027},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"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":12981,"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":[[1978]]},"DOI":"10.1016\/0012-365x(78)90109-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:45:00Z","timestamp":1027640700000},"page":"97-104","source":"Crossref","is-referenced-by-count":0,"title":["On an inverse for sections of a binomial matrix"],"prefix":"10.1016","volume":"23","author":[{"given":"Ian F.","family":"Blake","sequence":"first","affiliation":[]},{"given":"Avraham","family":"Melkman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(78)90109-7_BIB1","series-title":"Combinatorial Identities","author":"Gould","year":"1972"},{"key":"10.1016\/0012-365X(78)90109-7_BIB2","series-title":"Combinatorics","first-page":"115","article-title":"Weight Enumerators of Codes","author":"Sloane","year":"1975"},{"key":"10.1016\/0012-365X(78)90109-7_BIB3","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1109\/TIT.1972.1054898","article-title":"Generalizations of Gleason's Theorem on Weight Enumerator's of Self-Dual Codes","volume":"18","author":"MacWilliams","year":"1972","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/0012-365X(78)90109-7_BIB4","unstructured":"F.J. MacWilliams, A.M. Odlyzko, N.J.A. Sloane and H.N. Ward, Self-Dual Codes over GF(4) (to appear)."},{"key":"10.1016\/0012-365X(78)90109-7_BIB5","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0021-9800(69)80115-8","article-title":"New 5-designs","volume":"6","author":"Assmus","year":"1969","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0012-365X(78)90109-7_BIB6","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":"Information and Control"},{"key":"10.1016\/0012-365X(78)90109-7_BIB7","series-title":"The Theory of Error Correcting Codes","author":"MacWilliams","year":"1978"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78901097?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78901097?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:50:56Z","timestamp":1555120256000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X78901097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1978]]}},"alternative-id":["0012365X78901097"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(78)90109-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1978]]}}}