{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T00:44:47Z","timestamp":1708562687552},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,2,12]],"date-time":"2022-02-12T00:00:00Z","timestamp":1644624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,2,12]],"date-time":"2022-02-12T00:00:00Z","timestamp":1644624000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s00200-022-00542-x","type":"journal-article","created":{"date-parts":[[2022,2,12]],"date-time":"2022-02-12T15:02:49Z","timestamp":1644678169000},"page":"177-194","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distance-regular graphs and new block designs obtained from the Mathieu groups"],"prefix":"10.1007","volume":"35","author":[{"given":"Dean","family":"Crnkovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nina","family":"Mostarac","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"\u0160vob","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,12]]},"reference":[{"key":"542_CR1","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/S0021-9800(69)80115-8","volume":"6","author":"EF Assmus Jr","year":"1969","unstructured":"Assmus, E.F., Jr., Mattson, H.F., Jr.: New 5-designs. J. Combinatorial Theory A 6, 122\u2013151 (1969)","journal-title":"J. Combinatorial Theory A"},{"key":"542_CR2","doi-asserted-by":"publisher","first-page":"477","DOI":"10.3934\/amc.2007.1.477","volume":"1","author":"RF Bailey","year":"2007","unstructured":"Bailey, R.F., Bray, J.N.: Decoding the Mathieu group $$M_{12}$$. Adv. Math. Commun. 1, 477\u2013487 (2007)","journal-title":"Adv. Math. Commun."},{"key":"542_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1080\/01621459.1952.10501161","volume":"47","author":"RC Bose","year":"1952","unstructured":"Bose, R.C., Shimamoto, T.: Classification and analysis of partially balanced incomplete block designs with two associate classes. J. Amer. Statist. Assoc. 47, 151\u2013184 (1952)","journal-title":"J. Amer. Statist. Assoc."},{"key":"542_CR4","unstructured":"Bosma, W., Cannon, J.: Handbook of Magma Functions, Department of Mathematics, University of Sydney (1994). http:\/\/magma.maths.usyd.edu.au\/magma"},{"key":"542_CR5","unstructured":"Brouwer, A.E.: Strongly Regular Graphs, in: C.\u00a0J.\u00a0Colbourn, J.\u00a0H.\u00a0Dinitz (Eds.), Handbook of Combinatorial Designs, $$2^{\\rm nd}$$ ed., Chapman & Hall\/CRC, Boca Raton, pp. 852\u2013868 (2007)"},{"key":"542_CR6","unstructured":"Brouwer, A.E.: Parameters of Strongly Regular Graphs. Available at http:\/\/www.win.tue.nl\/$$\\sim$$aeb\/graphs\/srg\/srgtab.html, Accessed on 24\/02\/2021"},{"key":"542_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-Verlag, Berlin (1989)"},{"key":"542_CR8","volume-title":"Coherent configurations, association schemes and permutation groups, Groups, combinatorics & geometry (Durham, 2001), 55\u201371","author":"PJ Cameron","year":"2003","unstructured":"Cameron, P.J.: Coherent configurations, association schemes and permutation groups, Groups, combinatorics & geometry (Durham, 2001), 55\u201371. World Sci. Publ, River Edge, NJ (2003)"},{"key":"542_CR9","volume-title":"Atlas of Finite Groups","author":"JH Conway","year":"1985","unstructured":"Conway, J.H., Curtis, R.T., Norton, S.P., Parker, R.A., Wilson, R.A.: Atlas of Finite Groups. Oxford University Press, Eynsham (1985)"},{"key":"542_CR10","first-page":"149","volume":"73","author":"D Crnkovi\u0107","year":"2019","unstructured":"Crnkovi\u0107, D., Mikuli\u0107 Crnkovi\u0107, V., \u0160vob, A.: Block designs and strongly regular graphs admitting a transitive action of the Mathieu group $$M_{11}$$. Australas. J. Combin. 73, 149\u2013161 (2019)","journal-title":"Australas. J. Combin."},{"key":"542_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.jspi.2012.05.006","volume":"144","author":"D Crnkovi\u0107","year":"2014","unstructured":"Crnkovi\u0107, D., Mikuli\u0107 Crnkovi\u0107, V., \u0160vob, A.: On some transitive combinatorial structures constructed from the unitary group $$U(3,3)$$. J. Statist. Plann. Inference 144, 19\u201340 (2014)","journal-title":"J. Statist. Plann. Inference"},{"key":"542_CR12","doi-asserted-by":"publisher","first-page":"2723","DOI":"10.1016\/j.disc.2018.06.029","volume":"341","author":"D Crnkovi\u0107","year":"2018","unstructured":"Crnkovi\u0107, D., Rukavina, S., \u0160vob, A.: New strongly regular graphs from orthogonal groups $$O^+(6,2)$$ and $$O^-(6,2)$$. Discrete Math. 341, 2723\u20132728 (2018)","journal-title":"Discrete Math."},{"key":"542_CR13","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10801-019-00888-5","volume":"51","author":"D Crnkovi\u0107","year":"2020","unstructured":"Crnkovi\u0107, D., Rukavina, S., \u0160vob, A.: On some distance-regular graphs with many vertices. J. Algebraic Combin. 51, 641\u2013652 (2020)","journal-title":"J. Algebraic Combin."},{"key":"542_CR14","doi-asserted-by":"crossref","unstructured":"van Dam, E.R., Koolen, J.H., Tanaka, H.: Distance-Regular Graphs, Electron. J. Combin., DS22, Dynamic Survey, 156 pp (2016)","DOI":"10.37236\/4925"},{"key":"542_CR15","unstructured":"The GAP Group, GAP \u2013 Groups, Algorithms, and Programming, Version 4.11.0 (2020). (http:\/\/www.gap-system.org)"},{"key":"542_CR16","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/TIT.1982.1056504","volume":"28","author":"DM Gordon","year":"1982","unstructured":"Gordon, D.M.: Minimal permutation sets for decoding the binary Golay codes. IEEE Trans. Inform. Theory 28, 541\u2013543 (1982)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"542_CR17","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)"},{"key":"542_CR18","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1016\/j.disc.2016.11.031","volume":"340","author":"JD Key","year":"2017","unstructured":"Key, J.D., McDonough, T.P., Mavron, V.C.: Improved partial permutation decoding for Reed-Muller codes. Discrete Math. 340, 722\u2013728 (2017)","journal-title":"Discrete Math."},{"key":"542_CR19","unstructured":"Key, J.D., Rodrigues, B.G.: Minimal PD-sets for codes associated with the graphs $$Q_2^m$$, $$m$$ even, Appl. Algebra Engrg. Comm. Comput., (to appear)"},{"key":"542_CR20","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0012-365X(81)90236-3","volume":"36","author":"ES Kramer","year":"1981","unstructured":"Kramer, E.S., Magliveras, S.S., Mesner, D.M.: $$t$$-designs from large Mathieu groups. Discrete Math. 36, 171\u2013189 (1981)","journal-title":"Discrete Math."},{"key":"542_CR21","unstructured":"Lempken, W.: Two new symmetric 2-(144,66,30) designs, preprint (1999)"},{"key":"542_CR22","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1002\/j.1538-7305.1964.tb04075.x","volume":"43","author":"FJ MacWilliams","year":"1964","unstructured":"MacWilliams, F.J.: Permutation decoding of systematic codes. Bell System Tech. J. 43, 485\u2013505 (1964)","journal-title":"Bell System Tech. J."},{"key":"542_CR23","unstructured":"MacWilliams, F.J., Sloane ,N.J.A.: The Theory of Error-Correcting Codes. II, North-Holland Mathematical Library, Vol. 16. North-Holland Publishing Co., Amsterdam-New York-Oxford (1977)"},{"key":"542_CR24","first-page":"9","volume":"5","author":"E Mathieu","year":"1860","unstructured":"Mathieu, E.: Memoire sur le nombre de valeurs que peut acqu erir une function quand on y permut ses variables de toutes le maniere possibles. J. de Math. Pure et App. 5, 9\u201342 (1860)","journal-title":"J. de Math. Pure et App."},{"key":"542_CR25","first-page":"241","volume":"6","author":"E Mathieu","year":"1861","unstructured":"Mathieu, E.: Memoire sur l\u2018etude des functions de plusieures quantites, sur la maniere des formes et sur les substitutions qui laissent invariables. J. de Math. Pure et App. 6, 241\u2013323 (1861)","journal-title":"J. de Math. Pure et App."},{"key":"542_CR26","first-page":"25","volume":"18","author":"E Mathieu","year":"1873","unstructured":"Mathieu, E.: Sur la function cinq fois transitive des 24 quantites. J. de Math. Pure et App. 18, 25\u201346 (1873)","journal-title":"J. de Math. Pure et App."},{"key":"542_CR27","unstructured":"Mikuli\u0107 Crnkovi\u0107, V., Traunkar, I.: Self-orthogonal codes constructed from weakly self-orthogonal designs invariant under an action of $$M_{11}$$, Appl. Algebra Engrg. Comm. Comput., to appear"},{"key":"542_CR28","doi-asserted-by":"publisher","first-page":"2131","DOI":"10.1080\/00927872.2018.1530245","volume":"47","author":"J Moori","year":"2019","unstructured":"Moori, J., Rodrigues, B.G., Saeidi, A., Zandi, S.: Some symmetric designs invariant under the small Ree groups. Comm. Algebra 47, 2131\u20132148 (2019)","journal-title":"Comm. Algebra"},{"key":"542_CR29","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1090\/S0002-9904-1969-12418-3","volume":"75","author":"V Pless","year":"1969","unstructured":"Pless, V.: On a new family of symmetry codes and related new five-designs. Bull. Am. Math. Soc. 75, 1339\u20131342 (1969)","journal-title":"Bull. Am. Math. Soc."},{"key":"542_CR30","doi-asserted-by":"crossref","unstructured":"Pless, V.: Symmetry codes over GF(3) and new five-designs, J. Comb. Theory, Ser. A 12, 119\u2013142 (1972)","DOI":"10.1016\/0097-3165(72)90088-X"},{"key":"542_CR31","unstructured":"Pless, V.S., Huffman, W.C.: Handbook of Coding theory, North Holland, Amsterdam (1998)"},{"key":"542_CR32","volume-title":"Low Rank Representations and Graphs for Sporadic Groups, Australian Mathematical Society Lecture Series 8","author":"CE Praeger","year":"1997","unstructured":"Praeger, C.E., Soicher, L.H.: Low Rank Representations and Graphs for Sporadic Groups, Australian Mathematical Society Lecture Series 8. Cambridge University Press, Cambridge (1997)"},{"key":"542_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8594-1","volume-title":"A Course in the Theory of groups","author":"D Robinson","year":"1996","unstructured":"Robinson, D.: A Course in the Theory of groups. Springer-Verlag, New York, Berlin, Heidelberg (1996)"},{"key":"542_CR34","doi-asserted-by":"crossref","unstructured":"Soicher, L.H.: Yet another distance-regular graph related to Golay code, Electronic J. Combin. 2, N1, 4pp (1995)","DOI":"10.37236\/1220"},{"key":"542_CR35","volume-title":"Combinatorial Configurations: Designs, Codes, Graphs","author":"VD Tonchev","year":"1988","unstructured":"Tonchev, V.D.: Combinatorial Configurations: Designs, Codes, Graphs. John Willey & Sons, New York (1988)"},{"key":"542_CR36","volume-title":"Finite Permutation Groups","author":"H Wielandt","year":"1964","unstructured":"Wielandt, H.: Finite Permutation Groups. Academic Press, New York (1964)"},{"key":"542_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-988-2","volume-title":"The finite simple groups","author":"RA Wilson","year":"2009","unstructured":"Wilson, R.A.: The finite simple groups. Springer-Verlag, London (2009)"},{"key":"542_CR38","unstructured":"Wirth, W.: Konstruktion symmetrischer Designs, PhD thesis, Johannes Gutenberg-Universit\u00e4t Mainz (2000)"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-022-00542-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-022-00542-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-022-00542-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,21]],"date-time":"2024-02-21T08:04:04Z","timestamp":1708502644000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-022-00542-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,12]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["542"],"URL":"https:\/\/doi.org\/10.1007\/s00200-022-00542-x","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,12]]},"assertion":[{"value":"2 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}