{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:25Z","timestamp":1772283625373,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>The existence of optimal binary self-dual codes is a long-standing research problem. In this\u00a0 paper, we present some results concerning the decomposition of binary self-dual codes with a dihedral automorphism group $D_{2p}$, where $p$ is a prime. These results are applied to construct new self-dual codes with length $78$ or $116$. We obtain $16$ inequivalent self-dual $[78,39,14]$ codes, four of which have new weight enumerators. We also show that there are at least $141$ inequivalent self-dual $[116,58,18]$ codes, most of which are new up to equivalence. Meanwhile, we give some restrictions on the weight enumerators of singly even self-dual codes. We use these restrictions to exclude some possible weight enumerators of self-dual codes with lengths $74$, $76$, $82$, $98$ and $100$.<\/jats:p>","DOI":"10.37236\/5213","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T22:29:26Z","timestamp":1578695366000},"source":"Crossref","is-referenced-by-count":2,"title":["On the Existence of Certain Optimal Self-Dual Codes with Lengths Between 74 and 116"],"prefix":"10.37236","volume":"22","author":[{"given":"Tao","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Jerod","family":"Michel","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Gennian","family":"Ge","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2015,11,27]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v22i4p33\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v22i4p33\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T10:07:52Z","timestamp":1579255672000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v22i4p33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,27]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2015,10,16]]}},"URL":"https:\/\/doi.org\/10.37236\/5213","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,27]]},"article-number":"P4.33"}}