{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T05:35:25Z","timestamp":1744695325510},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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":3730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0166-218x(02)00440-7","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"121-143","source":"Crossref","is-referenced-by-count":10,"title":["Higher weights and graded rings for binary self-dual codes"],"prefix":"10.1016","volume":"128","author":[{"given":"Steven T.","family":"Dougherty","sequence":"first","affiliation":[]},{"given":"T.Aaron","family":"Gulliver","sequence":"additional","affiliation":[]},{"given":"Manabu","family":"Oura","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00440-7_BIB1","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1109\/18.59931","article-title":"A new upper bound on the minimal distance of self-dual codes","volume":"36","author":"Conway","year":"1990","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"10.1016\/S0166-218X(02)00440-7_BIB2","doi-asserted-by":"crossref","first-page":"2036","DOI":"10.1109\/18.641574","article-title":"Extremal binary self-dual codes","volume":"43","author":"Dougherty","year":"1997","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00440-7_BIB3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1155\/S1073792893000121","article-title":"On codes and Siegel modular forms","volume":"5","author":"Duke","year":"1993","journal-title":"Int. Math. Res. Notices"},{"key":"10.1016\/S0166-218X(02)00440-7_BIB4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0012-365X(79)90119-5","article-title":"The biweight enumerator of self-orthogonal binary codes","volume":"26","author":"Huffman","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00440-7_BIB5","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0012-365X(92)90559-X","article-title":"Support weight distributions of linear codes","volume":"106\/107","author":"Kl\u00f8ve","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00440-7_BIB6","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. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00440-7_BIB7","unstructured":"M. Oura, Explicit Relations, http:\/\/web.sapmed.ac.jp\/math."},{"key":"10.1016\/S0166-218X(02)00440-7_BIB8","series-title":"Handbook of Coding Theory","article-title":"Self-Dual Codes","author":"Rains","year":"1998"},{"key":"10.1016\/S0166-218X(02)00440-7_BIB9","doi-asserted-by":"crossref","unstructured":"B. Sturmfels, Algorithms in Invariant Theory, Texts and Monographs in Symbolic Computation, Springer, Wien, New York, 1993.","DOI":"10.1007\/978-3-7091-4368-1"},{"key":"10.1016\/S0166-218X(02)00440-7_BIB10","doi-asserted-by":"crossref","first-page":"1995","DOI":"10.1109\/18.476213","article-title":"Geometric approach to higher weights","volume":"41","author":"Tsfasman","year":"1995","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00440-7_BIB11","doi-asserted-by":"crossref","first-page":"1412","DOI":"10.1109\/18.133259","article-title":"Generalized Hamming weights for linear codes","volume":"37","author":"Wei","year":"1991","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004407?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004407?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T16:56:54Z","timestamp":1584464214000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0166218X02004407"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00440-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}