{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T13:48:19Z","timestamp":1782827299240,"version":"3.54.5"},"reference-count":13,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.disc.2026.115310","type":"journal-article","created":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T17:39:28Z","timestamp":1782754768000},"page":"115310","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["The neighbor graph of linear codes over finite fields"],"prefix":"10.1016","volume":"349","author":[{"given":"Steven T.","family":"Dougherty","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1409-1102","authenticated-orcid":false,"given":"Eseng\u00fcl","family":"Salt\u00fcrk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2026.115310_br0010","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/S0012-365X(99)00368-4","article-title":"Shadow lattices and shadow codes","volume":"219","author":"Dougherty","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115310_br0020","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1109\/18.382022","article-title":"Shadow codes and their weight enumerators","volume":"41","author":"Dougherty","year":"1995","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.disc.2026.115310_br0030","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10623-021-00985-2","article-title":"The neighbor graph of binary self-dual codes","volume":"90","author":"Dougherty","year":"2022","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/j.disc.2026.115310_br0040","first-page":"211","article-title":"New extremal self-dual binary codes of length 68 via composite construction, F2+uF2 lifts, extensions and neighbors","volume":"5","author":"Dougherty","year":"2020","journal-title":"Int. J. Inf. Coding Theory"},{"key":"10.1016\/j.disc.2026.115310_br0050","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1006\/ffta.2000.0312","article-title":"Shadow codes over Z4","volume":"7","author":"Dougherty","year":"2001","journal-title":"Finite Fields Appl."},{"key":"10.1016\/j.disc.2026.115310_br0060","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.ffa.2009.11.004","article-title":"Self-dual codes over commutative Frobenius rings","volume":"16","author":"Dougherty","year":"2010","journal-title":"Finite Fields Appl."},{"key":"10.1016\/j.disc.2026.115310_br0070","first-page":"171","article-title":"Constructions of self-dual codes over finite commutative chain rings","volume":"1","author":"Dougherty","year":"2010","journal-title":"Int. J. Inf. Coding Theory"},{"key":"10.1016\/j.disc.2026.115310_br0080","doi-asserted-by":"crossref","first-page":"963","DOI":"10.3934\/amc.2024035","article-title":"The neighbor graph of binary self-orthogonal codes","volume":"19","author":"Dougherty","year":"2025","journal-title":"Adv. Math. Commun."},{"key":"10.1016\/j.disc.2026.115310_br0090","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1016\/j.ffa.2020.101727","article-title":"New extremal binary self-dual codes of length 68 from generalized neighbors","volume":"67","author":"Gildea","year":"2020","journal-title":"Finite Fields Appl."},{"key":"10.1016\/j.disc.2026.115310_br0100","doi-asserted-by":"crossref","first-page":"738","DOI":"10.3934\/amc.2022021","article-title":"Binary self-dual codes of various lengths with new weight enumerators from a modified bordered construction and neighbours","volume":"18","author":"Gildea","year":"2024","journal-title":"Adv. Math. Commun."},{"key":"10.1016\/j.disc.2026.115310_br0110","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0021-9800(68)80067-5","article-title":"On the uniqueness of the Golay codes","volume":"5","author":"Pless","year":"1968","journal-title":"J. Comb. Theory"},{"key":"10.1016\/j.disc.2026.115310_br0120","series-title":"Finite Fields: Theory, Applications, and Algorithms, 2nd International Conference","first-page":"279","article-title":"Parents, children, neighbors and the shadow","author":"Pless","year":"1993"},{"key":"10.1016\/j.disc.2026.115310_br0130","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1137\/S0895480195294027","article-title":"On the dimension of the hull","volume":"10","author":"Sendrier","year":"1997","journal-title":"SIAM J. Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26003341?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26003341?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T13:24:56Z","timestamp":1782825896000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X26003341"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":13,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["S0012365X26003341"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115310","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The neighbor graph of linear codes over finite fields","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115310","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115310"}}