{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:48:56Z","timestamp":1772808536578,"version":"3.50.1"},"reference-count":21,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2020]]},"DOI":"10.3934\/amc.2020032","type":"journal-article","created":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T04:26:41Z","timestamp":1574656001000},"page":"591-602","source":"Crossref","is-referenced-by-count":2,"title":["Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs"],"prefix":"10.3934","volume":"14","author":[{"given":"Dean","family":"Crnkovi\u0107","sequence":"first","affiliation":[]},{"given":"Ronan","family":"Egan","sequence":"additional","affiliation":[{"name":"De Br\u00fan Centre for Mathematics, School of Mathematics, Statistics and Applied Mathematics, National University of Ireland, Galway"}]},{"given":"Andrea","family":"\u0160vob","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Rijeka, Croatia"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2020032-1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2010.10.005"},{"key":"key-10.3934\/amc.2020032-2","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"key":"key-10.3934\/amc.2020032-3","doi-asserted-by":"crossref","unstructured":"<p>A. E. Brouwer, A. M. Cohen and A. Neumaier, <i>Distance-Regular Graphs<\/i>, Results in Mathematics and Related Areas, 18, Springer-Verlag, Berlin, 1989.<\/p>","DOI":"10.1007\/978-3-642-74341-2"},{"key":"key-10.3934\/amc.2020032-4","unstructured":"<p>A. E. Brouwer, Strongly regular graphs, in <i>Handbook of Combinatorial Designs<\/i>, Chapman &amp; Hall\/CRC, Boca Raton, FL, 2007,852-868.<\/p>"},{"key":"key-10.3934\/amc.2020032-5","unstructured":"<p>A. E. Brouwer, Parameters of strongly regular graphs, Available from: <a href=\"http:\/\/www.win.tue.nl\/~aeb\/graphs\/srg\/srgtab.html\" target=\"_blank\">http:\/\/www.win.tue.nl\/~aeb\/graphs\/srg\/srgtab.html<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2020032-6","doi-asserted-by":"crossref","unstructured":"<p>A. E. Brouwer and W. H. Haemers, <i>Spectra of Graphs<\/i>, Universitext, Springer, New York, 2012.<\/p>","DOI":"10.1007\/978-1-4614-1939-6"},{"key":"key-10.3934\/amc.2020032-7","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2018.01.018"},{"key":"key-10.3934\/amc.2020032-8","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2016026"},{"key":"key-10.3934\/amc.2020032-9","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2013.7.161"},{"key":"key-10.3934\/amc.2020032-10","doi-asserted-by":"crossref","unstructured":"<p>S. T. Dougherty, <i>Algebraic Coding Theory Over Finite Commutative Rings<\/i>, SpringerBriefs in Mathematics, Springer, Cham, 2017.<\/p>","DOI":"10.1007\/978-3-319-59806-2"},{"key":"key-10.3934\/amc.2020032-11","unstructured":"<p>M. Grassl, Bounds on the minimum distance of linear codes and quantum codes, Available from: <a href=\"http:\/\/www.codetables.de\" target=\"_blank\">http:\/\/www.codetables.de<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2020032-12","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026479210284"},{"key":"key-10.3934\/amc.2020032-13","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(03)00100-8"},{"key":"key-10.3934\/amc.2020032-14","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2016035"},{"key":"key-10.3934\/amc.2020032-15","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(02)00553-8"},{"key":"key-10.3934\/amc.2020032-16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"},{"key":"key-10.3934\/amc.2020032-17","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2016.11.031"},{"key":"key-10.3934\/amc.2020032-18","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1964.tb04075.x"},{"key":"key-10.3934\/amc.2020032-19","unstructured":"<p>E. Spence, Strongly regular graphs on at most 64 vertices, Available from: <a href=\"http:\/\/www.maths.gla.ac.uk\/~es\/srgraphs.php\" target=\"_blank\">http:\/\/www.maths.gla.ac.uk\/~es\/srgraphs.php<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2020032-20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2017.10.009"},{"key":"key-10.3934\/amc.2020032-21","unstructured":"<p>V. D. Tonchev, <i>Combinatorial Configurations: Designs, Codes, Graphs<\/i>, Pitman Monographs and Surveys in Pure and Applied Mathematics, 40, John Wiley &amp; Sons, Inc., New York, 1988.<\/p>"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"https:\/\/www.aimsciences.org\/article\/exportPdf?id=63879cb1-c9eb-4dbf-9a13-74d60257c732","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:05:40Z","timestamp":1772791540000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2020032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2020032","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}