{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:38:22Z","timestamp":1775054302980,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T00:00:00Z","timestamp":1548288000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672036"],"award-info":[{"award-number":["61672036"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Technology Foundation for Selected Overseas Chinese Scholar, Ministry of Personnel of China","award":["05015133"],"award-info":[{"award-number":["05015133"]}]},{"name":"Excellent Youth Foundation of Natural Science Foundation of Anhui Province","award":["1808085J20"],"award-info":[{"award-number":["1808085J20"]}]},{"name":"Key projects of support program for outstanding young talents in Colleges and Universities","award":["gxyqZD2016008"],"award-info":[{"award-number":["gxyqZD2016008"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10623-019-00609-w","type":"journal-article","created":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T23:50:35Z","timestamp":1548373835000},"page":"2091-2101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A new distance-regular graph of diameter 3 on 1024 vertices"],"prefix":"10.1007","volume":"87","author":[{"given":"Minjia","family":"Shi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8516-755X","authenticated-orcid":false,"given":"Denis S.","family":"Krotov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4078-8301","authenticated-orcid":false,"given":"Patrick","family":"Sol\u00e9","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,24]]},"reference":[{"key":"609_CR1","volume-title":"Algebraic Combinatorics I: Association Schemes","author":"E Bannai","year":"1984","unstructured":"Bannai E., Ito T.: Algebraic Combinatorics I: Association Schemes. Benjamin\/Cummings, Menlo Park (1984)."},{"key":"609_CR2","unstructured":"Bassalygo L.A., Zaitsev G.V., Zinoviev V.A.: On uniformly packed codes. Probl. Inf. Transm. 10(1), 6\u20139 (1974). Translated from Probl. Peredachi Inf. 10(1), 9\u201314 (1974)."},{"issue":"4","key":"609_CR3","doi-asserted-by":"publisher","first-page":"1619","DOI":"10.1109\/18.923747","volume":"47","author":"J Borges","year":"2001","unstructured":"Borges J., Rif\u00e0 J., Zinoviev V.A.: Nonexistence of completely transitive codes with error-correcting capability \n                    \n                      \n                    \n                    $$e > 3$$\n                    \n                      \n                        \n                          e\n                          >\n                          3\n                        \n                      \n                    \n                  . IEEE Trans. Inf. Theory 47(4), 1619\u20131621 (2001). \n                    https:\/\/doi.org\/10.1109\/18.923747\n                    \n                  .","journal-title":"IEEE Trans. Inf. Theory"},{"key":"609_CR4","unstructured":"Borges J., Rif\u00e0 J., Zinoviev V.A.: Completely regular codes. \n                    arXiv:1703.08684\n                    \n                   (2017)."},{"issue":"3\u20134","key":"609_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma W., Cannon J., Playoust C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24(3\u20134), 235\u2013265 (1997). \n                    https:\/\/doi.org\/10.1006\/jsco.1996.0125\n                    \n                  .","journal-title":"J. Symb. Comput."},{"key":"609_CR6","unstructured":"Brouwer A.E.: Parameters of strongly regular graphs. \n                    https:\/\/www.win.tue.nl\/~aeb\/graphs\/srg\/srgtab.html\n                    \n                  ."},{"key":"609_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74341-2","volume-title":"Distance-Regular Graphs","author":"AE Brouwer","year":"1989","unstructured":"Brouwer A.E., Cohen A.M., Neumaier A.: Distance-Regular Graphs. Springer, Berlin (1989). \n                    https:\/\/doi.org\/10.1007\/978-3-642-74341-2\n                    \n                  ."},{"key":"609_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1939-6","volume-title":"Spectra of Graphs","author":"AE Brouwer","year":"2012","unstructured":"Brouwer A.E., Haemers W.H.: Spectra of Graphs. Springer, New York (2012). \n                    https:\/\/doi.org\/10.1007\/978-1-4614-1939-6\n                    \n                  ."},{"issue":"2","key":"609_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0195-6698(85)80004-4","volume":"6","author":"AR Calderbank","year":"1985","unstructured":"Calderbank A.R., Goethals J.M.: On a pair of dual subschemes of the Hamming scheme \n                    \n                      \n                    \n                    $$H_n(q)$$\n                    \n                      \n                        \n                          \n                            H\n                            n\n                          \n                          \n                            (\n                            q\n                            )\n                          \n                        \n                      \n                    \n                  . Eur. J. Comb. 6(2), 133\u2013147 (1985). \n                    https:\/\/doi.org\/10.1016\/S0195-6698(85)80004-4\n                    \n                  .","journal-title":"Eur. J. Comb."},{"issue":"2","key":"609_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1112\/blms\/18.2.97","volume":"18","author":"R Calderbank","year":"1986","unstructured":"Calderbank R., Kantor W.M.: The geometry of two-weight codes. Bull. Lond. Math. Soc. 18(2), 97\u2013122 (1986). \n                    https:\/\/doi.org\/10.1112\/blms\/18.2.97\n                    \n                  .","journal-title":"Bull. Lond. Math. Soc."},{"issue":"4","key":"609_CR11","doi-asserted-by":"publisher","first-page":"1369","DOI":"10.1109\/18.681315","volume":"44","author":"AR Calderbank","year":"1998","unstructured":"Calderbank A.R., Rains E.M., Shor P.M., Sloane N.J.A.: Quantum error correction via codes over GF(4). IEEE Trans. Inf. Theory 44(4), 1369\u20131387 (1998). \n                    https:\/\/doi.org\/10.1109\/18.681315\n                    \n                  .","journal-title":"IEEE Trans. Inf. Theory"},{"key":"609_CR12","unstructured":"Koolen J., Krotov D., Martin B.: Completely regular codes: Tables, \n                    \n                      \n                    \n                    $$\\rho =2$$\n                    \n                      \n                        \n                          \u03c1\n                          =\n                          2\n                        \n                      \n                    \n                  . \n                    https:\/\/sites.google.com\/site\/completelyregularcodes\/h\/r2"},{"key":"609_CR13","first-page":"1","volume":"10","author":"P Delsarte","year":"1973","unstructured":"Delsarte P.: An algebraic approach to association schemes of coding theory. Philips Res. Rep. Suppl. 10, 1\u201397 (1973).","journal-title":"Philips Res. Rep. Suppl."},{"issue":"7","key":"609_CR14","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1006\/eujc.1999.0313","volume":"20","author":"M Giudici","year":"1999","unstructured":"Giudici M., Praeger C.E.: Completely transitive codes in Hamming graphs. Eur. J. Comb. 20(7), 647\u2013662 (1999). \n                    https:\/\/doi.org\/10.1006\/eujc.1999.0313\n                    \n                  .","journal-title":"Eur. J. Comb."},{"key":"609_CR15","first-page":"9","volume":"30","author":"JM Goethals","year":"1975","unstructured":"Goethals J.M., van Tilborg H.C.A.: Uniformly packed codes. Philips Res. Rep. 30, 9\u201336 (1975).","journal-title":"Philips Res. Rep."},{"key":"609_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003). \n                    https:\/\/doi.org\/10.1017\/CBO9780511807077\n                    \n                  ."},{"issue":"2","key":"609_CR17","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1023\/A:1025484821641","volume":"30","author":"JL Kim","year":"2003","unstructured":"Kim J.L., Pless V.: Designs in additive codes over GF(4). Des. Codes Cryptogr. 30(2), 187\u2013199 (2003). \n                    https:\/\/doi.org\/10.1023\/A:1025484821641\n                    \n                  .","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"609_CR18","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10623-015-0066-6","volume":"80","author":"DS Krotov","year":"2016","unstructured":"Krotov D.S.: Perfect codes in Doob graphs. Des. Codes Cryptogr. 80(1), 91\u2013102 (2016). \n                    https:\/\/doi.org\/10.1007\/s10623-015-0066-6\n                    \n                  .","journal-title":"Des. Codes Cryptogr."},{"key":"609_CR19","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North Holland, Amsterdam (1977)."},{"issue":"3","key":"609_CR20","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1134\/S1064562414070291","volume":"90","author":"AA Makhnev","year":"2014","unstructured":"Makhnev A.A.: On automorphisms of a distance-regular graph with intersection array \n                    \n                      \n                    \n                    $$\\{33,30,15;1,2,15\\}$$\n                    \n                      \n                        \n                          {\n                          33\n                          ,\n                          30\n                          ,\n                          15\n                          \u037e\n                          1\n                          ,\n                          2\n                          ,\n                          15\n                          }\n                        \n                      \n                    \n                  . Dokl. Math. 90(3), 539\u2013543 (2014). \n                    https:\/\/doi.org\/10.1134\/S1064562414070291\n                    \n                  .","journal-title":"Dokl. Math."},{"issue":"2","key":"609_CR21","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0012-365X(90)90152-8","volume":"81","author":"P Sol\u00e9","year":"1990","unstructured":"Sol\u00e9 P.: Completely regular codes and completely transitive codes. Discret. Math. 81(2), 193\u2013201 (1990). \n                    https:\/\/doi.org\/10.1016\/0012-365X(90)90152-8\n                    \n                  .","journal-title":"Discret. Math."},{"key":"609_CR22","unstructured":"Stein W.A., et al.: Sage Mathematics Software, Version 6.9 (2015). \n                    http:\/\/www.sagemath.org\n                    \n                  ."},{"key":"609_CR23","unstructured":"van Dam E.R., Koolen J.H., Tanaka H.: Distance-regular graphs. Electron. J. Comb. Dyn. Survey #DS22 (2016). \n                    http:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/DS22\/pdf\n                    \n                  ."},{"key":"609_CR24","unstructured":"Williford J.S.: Table feasible parameter sets for primitive \n                    \n                      \n                    \n                    $$3$$\n                    \n                      \n                        \n                          3\n                        \n                      \n                    \n                  -class Q-polynomial association schemes. \n                    https:\/\/jaanos.github.io\/tables\/qpoly\/qprim3_table.html\n                    \n                  ."}],"updated-by":[{"DOI":"10.1007\/s10623-019-00672-3","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T00:00:00Z","timestamp":1566259200000}}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-019-00609-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00609-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00609-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,23]],"date-time":"2020-01-23T19:14:19Z","timestamp":1579806859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-019-00609-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,24]]},"references-count":24,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["609"],"URL":"https:\/\/doi.org\/10.1007\/s10623-019-00609-w","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s10623-019-00672-3","asserted-by":"object"}]},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,24]]},"assertion":[{"value":"26 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2019","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The article \u201cA new distance-regular graph of diameter 3 on 1024 vertices\", written by Minjia Shi, Denis S. Krotov and Patrick Sol\u00e9, was originally published electronically on the publisher's internet portal (currently SpringerLink) on 24 January 2019 without open access.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}