{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T06:45:57Z","timestamp":1742798757407},"reference-count":6,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1016\/s1571-0653(04)00199-4","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T09:34:04Z","timestamp":1113039244000},"page":"469-480","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Higher Weights and Binary Self-Dual Codes"],"prefix":"10.1016","volume":"6","author":[{"given":"Steven T.","family":"Dougherty","sequence":"first","affiliation":[]},{"given":"T.Aaron","family":"Gulliver","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00199-4_NEWBIB1","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":"vol. 36","author":"Conway","year":"1990","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S1571-0653(04)00199-4_NEWBIB2","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":"vol. 26","author":"Huffman","year":"1979","journal-title":"Discrete Math"},{"key":"10.1016\/S1571-0653(04)00199-4_NEWBIB3","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0012-365X(92)90559-X","article-title":"Support weight distributions of linear codes","volume":"vol. 106\/107","author":"Klove","year":"1992","journal-title":"Discrete Math"},{"key":"10.1016\/S1571-0653(04)00199-4_NEWBIB4","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":"vol. 18","author":"MacWilliams","year":"1972","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S1571-0653(04)00199-4_NEWBIB5","doi-asserted-by":"crossref","first-page":"1564","DOI":"10.1109\/18.476213","article-title":"Geometric approach to higher weights","volume":"vol. 41","author":"Michael Tsfasman","year":"1995","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S1571-0653(04)00199-4_NEWBIB6","doi-asserted-by":"crossref","first-page":"1412","DOI":"10.1109\/18.133259","article-title":"Generalized hamming weights for linear codes","volume":"vol. 37","author":"Wei","year":"1991","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304001994?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304001994?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T08:51:00Z","timestamp":1548579060000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304001994"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":6,"alternative-id":["S1571065304001994"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00199-4","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}