{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:58:59Z","timestamp":1772809139756,"version":"3.50.1"},"reference-count":28,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2016]]},"DOI":"10.3934\/amc.2016026","type":"journal-article","created":{"date-parts":[[2016,8,12]],"date-time":"2016-08-12T11:14:28Z","timestamp":1471000468000},"page":"555-582","source":"Crossref","is-referenced-by-count":10,"title":["Self-orthogonal codes from the strongly regular graphs on up to 40 vertices"],"prefix":"10.3934","volume":"10","author":[{"given":"Dean","family":"Crnkovi\u0107","sequence":"first","affiliation":[]},{"given":"Marija","family":"Maksimovi\u0107","sequence":"additional","affiliation":[]},{"given":"Bernardo Gabriel","family":"Rodrigues","sequence":"additional","affiliation":[]},{"given":"Sanja","family":"Rukavina","sequence":"additional","affiliation":[]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2016026-1","doi-asserted-by":"publisher","unstructured":"E. F. Assmus, Jr. and J. D. Key, <em>Designs and their Codes<\/em>, Cambridge Univ. Press, 1992.","DOI":"10.1017\/CBO9781316529836"},{"key":"key-10.3934\/amc.2016026-2","doi-asserted-by":"publisher","unstructured":"M. Behbahani and C. Lam, Strongly regular graphs with non-trivial automorphisms, <em>Discrete Math.<\/em>, <strong>311<\/strong> (2011), 132-144.","DOI":"10.1016\/j.disc.2010.10.005"},{"key":"key-10.3934\/amc.2016026-3","doi-asserted-by":"crossref","unstructured":"T. Beth, D. Jungnickel and H. Lenz, <em>Design Theory I<\/em>, Cambridge Univ. Press, Cambridge, 1999.","DOI":"10.1017\/CBO9781139507660"},{"key":"key-10.3934\/amc.2016026-4","doi-asserted-by":"publisher","unstructured":"W. Bosma, J. Cannon and C. Playoust, The Magma algebra system I: The user language, <em>J. Symb. Comput.<\/em>, <strong>24<\/strong> (1997), 235-265.","DOI":"10.1006\/jsco.1996.0125"},{"key":"key-10.3934\/amc.2016026-5","doi-asserted-by":"publisher","unstructured":"I. Bouyukliev, On the binary projective codes with dimension 6, <em>Discrete Appl. Math.<\/em>, <strong>154<\/strong> (2006), 1693-1708.","DOI":"10.1016\/j.dam.2006.03.004"},{"key":"key-10.3934\/amc.2016026-6","doi-asserted-by":"publisher","unstructured":"I. Bouyukliev, V. Fack, W. Willems and J. Winne, Projective two-weight codes with small parameters and their corresponding graphs, <em>Des. Codes Cryptogr.<\/em>, <strong>41<\/strong> (2006), 59-78.","DOI":"10.1007\/s10623-006-0019-1"},{"key":"key-10.3934\/amc.2016026-7","doi-asserted-by":"publisher","unstructured":"A. E. Brouwer and W. H. Haemers, Structure and uniqueness of the $(81,20,1,6)$ strongly regular graph, <em>Discrete Math.<\/em>, <strong>106\/107<\/strong> (1992), 77-82.","DOI":"10.1016\/0012-365X(92)90532-K"},{"key":"key-10.3934\/amc.2016026-8","unstructured":"D. Crnkovi\u0107, V. Mikuli\u0107 Crnkovi\u0107 and B. G. Rodrigues, Some optimal codes and strongly regular graphs from the linear group $L_4(3)$, <em>Util. Math.<\/em>, <strong>89<\/strong> (2012), 237-255."},{"key":"key-10.3934\/amc.2016026-9","doi-asserted-by":"publisher","unstructured":"D. Crnkovi\u0107, B. G. Rodrigues, S. Rukavina and L. Sim\u010di\u0107, Self-orthogonal codes from orbit matrices of $2$-designs, <em>Adv. Math. Commun.<\/em>, <strong>7<\/strong> (2013), 161-174.","DOI":"10.3934\/amc.2013.7.161"},{"key":"key-10.3934\/amc.2016026-10","doi-asserted-by":"publisher","unstructured":"D. Crnkovi\u0107 and S. Rukavina, Construction of block designs admitting an abelian automorphism group, <em>Metrika<\/em>, <strong>62<\/strong> (2005), 175-183.","DOI":"10.1007\/s00184-005-0407-y"},{"key":"key-10.3934\/amc.2016026-11","unstructured":"D. Crnkovi\u0107 and S. Rukavina, On some symmetric $(45, 12, 3)$ and $(40,13, 4)$ designs, <em>J. Comput. Math. Optim.<\/em>, <strong>1<\/strong> (2005), 55-63."},{"key":"key-10.3934\/amc.2016026-12","unstructured":"M. Grassl, Bounds on the minimum distance of linear codes and quantum codes, <a href=\"http:\/\/www.codetables.de\" target=\"_blank\">http:\/\/www.codetables.de<\/a>, Accessed 9 June 2016."},{"key":"key-10.3934\/amc.2016026-13","doi-asserted-by":"publisher","unstructured":"W. H. Haemers, R. Peeters and J. M. van Rijckevorsel, Binary codes of strongly regular graphs, <em>Des. Codes Cryptogr.<\/em>, <strong>17<\/strong> (1999), 187-209.","DOI":"10.1023\/A:1008353723204"},{"key":"key-10.3934\/amc.2016026-14","doi-asserted-by":"crossref","unstructured":"N. Hamada, On the $p$-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its application to error correcting codes, <em>Hiroshima Math. J.<\/em>, <strong>3<\/strong> (1973), 153-226.","DOI":"10.32917\/hmj\/1206137446"},{"key":"key-10.3934\/amc.2016026-15","doi-asserted-by":"publisher","unstructured":"M. Harada and V. D. Tonchev, Self-orthogonal codes from symmetric designswith fixed-point-free automorphisms, <em>Discrete Math.<\/em>, <strong>264<\/strong> (2003), 81-90.","DOI":"10.1016\/S0012-365X(02)00553-8"},{"key":"key-10.3934\/amc.2016026-16","doi-asserted-by":"publisher","unstructured":"R. Hill and D. E. Newton, Optimal ternary linear codes, <em>Des. Codes Cryptogr.<\/em>, <strong>2<\/strong> (1992), 137-157.","DOI":"10.1007\/BF00124893"},{"key":"key-10.3934\/amc.2016026-17","doi-asserted-by":"publisher","unstructured":"Z. Janko, Coset enumeration in groups and constructions of symmetric designs, <em>Ann. Discrete Math.<\/em>, <strong>52<\/strong> (1992), 275-277.","DOI":"10.1016\/S0167-5060(08)70919-1"},{"key":"key-10.3934\/amc.2016026-18","unstructured":"C. Jansen, K. Lux, R. Parker and R. Wilson, <em>An Atlas of Brauer Characters<\/em>, Oxford Scient. Publ., Clarendon Press, 1995."},{"key":"key-10.3934\/amc.2016026-19","unstructured":"J. D. Key and K. Mackenzie-Fleming, Rigidity theorems for a class of affine resolvable designs, <em>J. Combin. Math. Combin. Comput.<\/em>, <strong>35<\/strong> (2000), 147-160."},{"key":"key-10.3934\/amc.2016026-20","unstructured":"R. Mathon and A. Rosa, 2-$(v,k,\\lambda)$ designs of small order, in <em>Handbook of Combinatorial Designs<\/em> (eds. C.J. Colbourn and J.H. Dinitz), Chapman and Hall\/CRC, Boca Raton, 2007, 25-58."},{"key":"key-10.3934\/amc.2016026-21","unstructured":"B. D. McKay and E. Spence, Classification of regular two-graphs on 36 and 38 vertices, <em>Austral. J. Combin.<\/em>, <strong>24<\/strong> (2001), 293-300."},{"key":"key-10.3934\/amc.2016026-22","doi-asserted-by":"publisher","unstructured":"B. G. Rodrigues, Self-orthogonal designs and codes from the symplectic groups $S_4(3)$ and $S_4(4)$, <em>Discrete Math.<\/em>, <strong>308<\/strong> (2008), 1941-1950.","DOI":"10.1016\/j.disc.2007.04.047"},{"key":"key-10.3934\/amc.2016026-23","doi-asserted-by":"publisher","unstructured":"B. G. Rodrigues, Some optimal codes related to graphs invariant under the alternating group $A_8$, <em>Adv. Math. Commun.<\/em>, <strong>5<\/strong> (2011), 339-350.","DOI":"10.3934\/amc.2011.5.339"},{"key":"key-10.3934\/amc.2016026-24","doi-asserted-by":"crossref","unstructured":"L. D. Rudolph, A class of majority logic decodable codes, <em>IEEE Trans. Inform. Theory<\/em>, <strong>13<\/strong> (1967), 305-307.","DOI":"10.1109\/TIT.1967.1053994"},{"key":"key-10.3934\/amc.2016026-25","doi-asserted-by":"publisher","unstructured":"S. S. Sane and M. S. Shrikhande, <em>Quasi-Symmetric Designs<\/em>, Cambridge Univ. Press, 1991.","DOI":"10.1017\/CBO9780511665615"},{"key":"key-10.3934\/amc.2016026-26","doi-asserted-by":"crossref","unstructured":"E. Spence, The strongly regular $(40,12,2,4)$ graphs, <em>Electron. J. Combin.<\/em>, <strong>7<\/strong> (2000), \\#22, pp. 4.","DOI":"10.37236\/1500"},{"key":"key-10.3934\/amc.2016026-27","unstructured":"E. Spence, Strongly regular graphs on at most 64 vertices, <a href=\"http:\/\/www.maths.gla.ac.uk\/ es\/srgraphs.php\" target=\"_blank\">http:\/\/www.maths.gla.ac.uk\/ es\/srgraphs.php<\/a>, Accessed 9 June 2016."},{"key":"key-10.3934\/amc.2016026-28","unstructured":"V. D. Tonchev, Codes, in <em>Handbook of Combinatorial Designs<\/em>, (eds. C.J. Colbourn and J.H. Dinitz), Chapman and Hall\/CRC, Boca Raton, 2007, 667-702."}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"http:\/\/www.aimsciences.org\/journals\/displayArticlesnew.jsp?paperID=12784","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:07:25Z","timestamp":1772791645000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2016026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2016026","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}