{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:35:58Z","timestamp":1775054158240,"version":"3.50.1"},"reference-count":22,"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.2016020","type":"journal-article","created":{"date-parts":[[2016,8,12]],"date-time":"2016-08-12T11:14:28Z","timestamp":1471000468000},"page":"489-498","source":"Crossref","is-referenced-by-count":4,"title":["Further results on the classification of MDS codes"],"prefix":"10.3934","volume":"10","author":[{"given":"Janne I.","family":"Kokkala","sequence":"first","affiliation":[]},{"given":"Patric R. J. \u007f","family":"\u00d6sterg\u00e5rd","sequence":"additional","affiliation":[]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2016020-1","doi-asserted-by":"publisher","unstructured":"T. L. Alderson, $(6,3)$-MDS codes over an alphabet of size 4, <em>Des. Codes Cryptogr.<\/em>, <strong>38<\/strong> (2006), 31-40.","DOI":"10.1007\/s10623-004-5659-4"},{"key":"key-10.3934\/amc.2016020-2","doi-asserted-by":"publisher","unstructured":"T. L. Alderson, A. A. Bruen and R. Silverman, Maximum distance separable codes and arcs in projective spaces, <em>J. Combin. Theory Ser. A<\/em>, <strong>114<\/strong> (2007), 1101-1117.","DOI":"10.1016\/j.jcta.2006.11.005"},{"key":"key-10.3934\/amc.2016020-3","doi-asserted-by":"publisher","unstructured":"T. L. Alderson and A. G\u00e1cs, On the maximality of linear codes, <em>Des. Codes Cryptogr.<\/em>, <strong>53<\/strong> (2009), 59-68.","DOI":"10.1007\/s10623-009-9293-z"},{"key":"key-10.3934\/amc.2016020-4","doi-asserted-by":"publisher","unstructured":"S. Ball, On sets of vectors of a finite vector space in which every subset of basis size is a basis, <em>J. Eur. Math. Soc.<\/em>, <strong>14<\/strong> (2012), 733-748.","DOI":"10.4171\/JEMS\/316"},{"key":"key-10.3934\/amc.2016020-5","doi-asserted-by":"publisher","unstructured":"S. Ball and J. De Beule, On sets of vectors of a finite vector space in which every subset of basis size is a basis II, <em>Des. Codes Cryptogr.<\/em>, <strong>65<\/strong> (2012), 5-14.","DOI":"10.1007\/s10623-012-9658-6"},{"key":"key-10.3934\/amc.2016020-6","unstructured":"A. Betten, M. Braun, H. Fripertinger, A. Kerber, A. Kohnert and A. Wassermann, <em>Error-Correcting Linear Codes: Classification by Isometry and Applications<\/em>, Springer, Berlin, 2006."},{"key":"key-10.3934\/amc.2016020-7","doi-asserted-by":"publisher","unstructured":"J. Egan and I. M. Wanless, Enumeration of MOLS of small order, <em>Math. Comp.<\/em>, <strong>85<\/strong> (2016), 799-824.","DOI":"10.1090\/mcom\/3010"},{"key":"key-10.3934\/amc.2016020-8","unstructured":"P. Kaski and P. R. J. \u00d6sterg\u00e5rd, <em>Classification Algorithms for Codes and Designs<\/em>, Springer, Berlin, 2006."},{"key":"key-10.3934\/amc.2016020-9","unstructured":"P. Kaski and O. Pottonen, <em>Libexact User's Guide, version 1.0<\/em>, Technical Reports TR 2008-1, Helsinki Inst. Inform. Techn., Helsinki, 2008."},{"key":"key-10.3934\/amc.2016020-10","doi-asserted-by":"publisher","unstructured":"G. K\u00e9ri, Types of superregular matrices and the number of $n$-arcs and complete $n$-arcs in $PG(r, q)$, <em>J. Combin. Des.<\/em>, <strong>14<\/strong> (2006), 363-390.","DOI":"10.1002\/jcd.20091"},{"key":"key-10.3934\/amc.2016020-11","doi-asserted-by":"publisher","unstructured":"J. I. Kokkala, D. S. Krotov and P. R. J. \u00d6sterg\u00e5rd, On the classification of MDS codes, <em>IEEE Trans. Inf. Theory<\/em>, <strong>61<\/strong> (2015), 6485-6492.","DOI":"10.1109\/TIT.2015.2488659"},{"key":"key-10.3934\/amc.2016020-12","doi-asserted-by":"publisher","unstructured":"J. I. Kokkala and P. R. J. \u00d6sterg\u00e5rd, Classification of Graeco-Latin cubes, <em>J. Combin. Des.<\/em>, <strong>23<\/strong> (2015), 509-512.","DOI":"10.1002\/jcd.21400"},{"key":"key-10.3934\/amc.2016020-13","unstructured":"F. J. MacWilliams and N. J. A. Sloane, <em>The Theory of Error-Correcting Codes<\/em>, North-Holland, Amsterdam, 1977."},{"key":"key-10.3934\/amc.2016020-14","doi-asserted-by":"publisher","unstructured":"B. M. Maenhaut and I. M. Wanless, Atomic Latin squares of order eleven, <em>J. Combin. Des.<\/em>, <strong>12<\/strong> (2004), 12-34.","DOI":"10.1002\/jcd.10064"},{"key":"key-10.3934\/amc.2016020-15","doi-asserted-by":"publisher","unstructured":"B. D. McKay, A. Meynert and W. Myrvold, Small Latin squares, quasigroups, and loops, <em>J. Combin. Des.<\/em>, <strong>15<\/strong> (2007), 98-119.","DOI":"10.1002\/jcd.20105"},{"key":"key-10.3934\/amc.2016020-16","doi-asserted-by":"publisher","unstructured":"B. D. McKay and A. Piperno, Practical graph isomorphism, II, <em>J. Symbolic Comput.<\/em>, <strong>60<\/strong> (2014), 94-112.","DOI":"10.1016\/j.jsc.2013.09.003"},{"key":"key-10.3934\/amc.2016020-17","doi-asserted-by":"publisher","unstructured":"B. D. McKay and I. M. Wanless, A census of small Latin hypercubes, <em>SIAM J. Discrete Math.<\/em>, <strong>22<\/strong> (2008), 719-736.","DOI":"10.1137\/070693874"},{"key":"key-10.3934\/amc.2016020-18","unstructured":"S. Niskanen and P. R. J. \u00d6sterg\u00e5rd, <em>Cliquer User's guide, Version 1.0<\/em>, Technical Report T48, Communications Laboratory, Helsinki Univ. Techn., Espoo, 2003."},{"key":"key-10.3934\/amc.2016020-19","doi-asserted-by":"publisher","unstructured":"P. R. J. \u00d6sterg\u00e5rd, Constructing combinatorial objects via cliques, in <em>Surveys in Combinatorics 2005<\/em> (ed. B. S. Webb), Cambridge Univ. Press, Cambridge, 2005, 57-82.","DOI":"10.1017\/CBO9780511734885.004"},{"key":"key-10.3934\/amc.2016020-20","doi-asserted-by":"crossref","unstructured":"E. T. Parker, Computer investigation of orthogonal Latin squares of order ten, in <em>Proc. Sympos. Appl. Math.<\/em>, Amer. Math. Soc., Providence, 1963, 73-81.","DOI":"10.1090\/psapm\/015\/0180910"},{"key":"key-10.3934\/amc.2016020-21","doi-asserted-by":"publisher","unstructured":"V. N. Potapov and D. S. Krotov, On the number of $n$-ary quasigroups of finite order, <em>Discrete Math. Appl.<\/em>, <strong>21<\/strong> (2011), 575-585.","DOI":"10.1016\/j.disc.2010.09.023"},{"key":"key-10.3934\/amc.2016020-22","doi-asserted-by":"publisher","unstructured":"B. Segre, Curve razionali normali e $k$-archi negli spazi finiti, <em>Ann. Mat. Pura Appl.<\/em>, <strong>39<\/strong> (1955), 357-379.","DOI":"10.1007\/BF02410779"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"http:\/\/www.aimsciences.org\/journals\/displayArticlesnew.jsp?paperID=12778","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:06:56Z","timestamp":1772791616000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2016020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2016020","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}