{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T09:15:51Z","timestamp":1776849351165,"version":"3.51.2"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,11,26]],"date-time":"2008-11-26T00:00:00Z","timestamp":1227657600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1007\/s10623-008-9247-x","type":"journal-article","created":{"date-parts":[[2008,11,26]],"date-time":"2008-11-26T11:55:22Z","timestamp":1227700522000},"page":"105-122","source":"Crossref","is-referenced-by-count":9,"title":["2-(31,15,7), 2-(35,17,8) and 2-(36,15,6) designs with automorphisms of odd prime order, and their related Hadamard matrices and codes"],"prefix":"10.1007","volume":"51","author":[{"given":"Iliya","family":"Bouyukliev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Veerle","family":"Fack","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joost","family":"Winne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,11,26]]},"reference":[{"key":"9247_CR1","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/0097-3165(71)90054-9","volume":"11","author":"M. Aschbacher","year":"1971","unstructured":"Aschbacher M.: On collineation groups of symmetric block designs. J. Combin. Theory A 11, 272\u2013281 (1971)","journal-title":"J. Combin. Theory A"},{"key":"9247_CR2","first-page":"115","volume":"1","author":"I. Bouyukliev","year":"2007","unstructured":"Bouyukliev I.: What is Q-extension? Serdica J. Comput. 1, 115\u2013130 (2007)","journal-title":"Comput."},{"key":"9247_CR3","unstructured":"Bouyukliev I., Fack V., Winne J.: Hadamard matrices of order 36 and doubly-even self-dual [72,36,12] codes. In: Discrete Math. Theoretical Computer Science Proceedings AE, pp. 93\u201398 (2005)."},{"key":"9247_CR4","doi-asserted-by":"crossref","first-page":"4244","DOI":"10.1109\/TIT.2006.880048","volume":"52","author":"S. Bouyuklieva","year":"2006","unstructured":"Bouyuklieva S., O\u2019Brien E.A., Willems W.: The automorphism group of a binary self-dual doubly even [72,36,16] code is solvable. IEEE Trans. Inform. Theory 52, 4244\u20134248 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"9247_CR5","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/jcd.3180020205","volume":"2","author":"A.R. Camina","year":"1994","unstructured":"Camina A.R.: A survey of the automorphism groups of block designs. J. Combin. Des. 2(2), 79\u2013100 (1994)","journal-title":"J. Combin. Des."},{"key":"9247_CR6","volume-title":"The CRC Handbook of Combinatorial Designs","year":"2006","unstructured":"Colbourn, C.J., Dinitz, J.H. (eds): The CRC Handbook of Combinatorial Designs, 2nd edn. CRC Press, Boca Raton, FL (2006)","edition":"2"},{"issue":"2","key":"9247_CR7","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1109\/TIT.2003.822598","volume":"50","author":"R. Dontcheva","year":"2004","unstructured":"Dontcheva R., van Zanten A.J., Dodunekov S.M.: Binary self-dual codes with automorphisms of composite order. IEEE Trans. Inform. Theory 50(2), 311\u2013318 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9247_CR8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.3934\/amc.2007.1.45","volume":"1","author":"S. Dougherty","year":"2007","unstructured":"Dougherty S., Kim J.-L., Sol\u00e9 P.: Double circulant codes from two class association schemes. Adv. Math. Commun. 1, 45\u201364 (2007)","journal-title":"Adv. Math. Commun."},{"key":"9247_CR9","first-page":"133","volume-title":"Designs 2002: Further Combinatorial and Constructive Design Theory.","author":"S. Georgiou","year":"2002","unstructured":"Georgiou S., Koukouvinos C., Seberry J.: Hadamard matrices, orthogonal designs and construction algorithms. In: Wallis, W.D. (eds) Designs 2002: Further Combinatorial and Constructive Design Theory., pp. 133\u2013205. Kluwer, Academic Publishers, Norwell, Massachusetts (2002)"},{"key":"9247_CR10","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1006\/jcta.2000.3166","volume":"95","author":"Z. Janko","year":"2006","unstructured":"Janko Z.: The existence of a Bush-type Hadamard matrix of order 36 and two new infinite classes of symmetric designs. J. Combin. Theory Ser. A 95, 360\u2013364 (2006)","journal-title":"J. Combin. Theory Ser. A"},{"key":"9247_CR11","first-page":"301","volume":"34","author":"S.N. Kapralov","year":"1987","unstructured":"Kapralov S.N., Landgev I.N., Tonchev V.D.: 2-(25,10,6) designs invariant under the dihedral group of order 10. Ann. Discrete Math. 34, 301\u2013306 (1987)","journal-title":"Ann. Discrete Math."},{"key":"9247_CR12","unstructured":"Lam C.: Computer Construction of Block Designs, in Surveys in Combinatorics. London Math. Soc. LNS 241, pp. 49\u201364 (1997)."},{"key":"9247_CR13","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1002\/jcd.1017","volume":"9","author":"C. Lam","year":"2001","unstructured":"Lam C., Lam S., Tonchev V.D.: Bounds on the number of Hadamard designs of even order. J. Combin. Des. 9, 363\u2013378 (2001)","journal-title":"J. Combin. Des."},{"key":"9247_CR14","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01894291","volume":"42","author":"D.K.J. Lin","year":"1995","unstructured":"Lin D.K.J., Draper N.R.: Screening properties of certain two-level designs. Metrika 42, 99\u2013118 (1995)","journal-title":"Metrika"},{"key":"9247_CR15","first-page":"397","volume":"18","author":"C. Lin","year":"1993","unstructured":"Lin C., Wallis D., Zhu L.: Generalized 4-profiles of Hadamard matrices. J. Comb. Inform. Syst. Sci. 18, 397\u2013400 (1993)","journal-title":"J. Comb. Inform. Syst. Sci."},{"key":"9247_CR16","unstructured":"Lin C., Wallis D., Zhu L.: Hadamard matrices of order 32 II, Tech. Report 93-05. Department of Mathematical Science, University of Nevada, Las Vegas, Nevada, Preprint (1993)."},{"key":"9247_CR17","unstructured":"Mathon R.: Computational Methods in Design Theory, in Surveys in Combinatorics. London Math. Soc. LNS 166, pp. 101\u2013118 (1991)."},{"key":"9247_CR18","first-page":"171","volume":"25","author":"R. Mathon","year":"1988","unstructured":"Mathon R.: Symmetric (31,10,3) design with non-trivial automorphism group. Ars Combin. 25, 171\u2013183 (1988)","journal-title":"Ars Combin."},{"key":"9247_CR19","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0012-365X(79)90113-4","volume":"27","author":"B.D. McKay","year":"1979","unstructured":"McKay B.D.: Hadamard equivalence via graph isomorphism. Discrete Math. 27, 213\u2013214 (1979)","journal-title":"Discrete Math."},{"key":"9247_CR20","unstructured":"McKay B.D.: Nauty users\u2019 guide (version 2.2). Technical Report, Computer Science Department, Australian National University (2004)."},{"key":"9247_CR21","unstructured":"Orrick W.P.: Switching operations for Hadamard matrices. http:\/\/arxiv.org\/math\/0507515 (2005)."},{"key":"9247_CR22","unstructured":"Seberry J.: Library of Hadamard matrices. http:\/\/www.uow.edu.au\/~jennie\/hadamard.html ."},{"key":"9247_CR23","first-page":"431","volume-title":"Hadamard Matrices, Sequences and Block Designs","author":"J. Seberry","year":"1992","unstructured":"Seberry J., Yamada M.: Hadamard Matrices, Sequences and Block Designs, pp. 431\u2013560. Wiley, New York (1992)"},{"key":"9247_CR24","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1109\/TIT.1973.1054975","volume":"19","author":"N.J.A. Sloane","year":"1973","unstructured":"Sloane N.J.A.: Is there a (72,36), d\u00a0=\u00a016 self-dual code? IEEE Trans. Inform. Theory 19, 251 (1973)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9247_CR25","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0012-365X(92)90716-S","volume":"110","author":"E. Spence","year":"1992","unstructured":"Spence E., Tonchev V.D.: Extremal self-dual codes from symmetric designs. Discrete Math. 110, 265\u2013268 (1992)","journal-title":"Discrete Math."},{"key":"9247_CR26","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1017\/S002776300002273X","volume":"104","author":"V.D. Tonchev","year":"1986","unstructured":"Tonchev V.D.: Hadamard matrices of order 36 with automorphisms of order 17. Nagoya Math. J. 104, 163\u2013174 (1986)","journal-title":"Nagoya Math. J."},{"key":"9247_CR27","volume-title":"Combinatorial Configurations: Designs, Codes, Graphs","author":"V.D. Tonchev","year":"1988","unstructured":"Tonchev V.D.: Combinatorial Configurations: Designs, Codes, Graphs. Longman Scientific & Technical, Harlow, John Wiley & Sons, Inc., New York (1988)"},{"key":"9247_CR28","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/S0167-5060(08)70268-1","volume":"37","author":"V.D. Tonchev","year":"1988","unstructured":"Tonchev V.D.: Symmetric designs without ovals and extremal self-dual codes. Ann. Discrete Math. 37, 451\u2013458 (1988)","journal-title":"Ann. Discrete Math."},{"key":"9247_CR29","doi-asserted-by":"crossref","first-page":"1724","DOI":"10.1109\/TIT.2006.871611","volume":"52","author":"V. Yorgov","year":"2006","unstructured":"Yorgov V.: On the automorphism Group of a putative code. IEEE Trans. Inform. Theory 52, 1724\u20131726 (2006)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9247-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-008-9247-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9247-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:25Z","timestamp":1559231905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-008-9247-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,26]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["9247"],"URL":"https:\/\/doi.org\/10.1007\/s10623-008-9247-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,26]]}}}