{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,19]],"date-time":"2023-11-19T17:11:30Z","timestamp":1700413890700},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4641,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[2000,11]]},"DOI":"10.1006\/jcta.2000.3060","type":"journal-article","created":{"date-parts":[[2002,9,18]],"date-time":"2002-09-18T13:38:25Z","timestamp":1032356305000},"page":"186-196","source":"Crossref","is-referenced-by-count":21,"title":["Bounds on the Number of Affine, Symmetric, and Hadamard Designs and Matrices"],"prefix":"10.1006","volume":"92","author":[{"given":"Clement","family":"Lam","sequence":"first","affiliation":[]},{"given":"Sigmund","family":"Lam","sequence":"additional","affiliation":[]},{"given":"Vladimir D.","family":"Tonchev","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1006\/jcta.2000.3060_RF1","series-title":"Design Theory","author":"Beth","year":"1993"},{"key":"10.1006\/jcta.2000.3060_RF2","first-page":"38","article-title":"Nonisomorphic solutions of some BIBDs, III","volume":"12","author":"Bhat","year":"1972","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1006\/jcta.2000.3060_RF3","series-title":"The CRC Handbook of Combinatorial Designs","author":"Colbourn","year":"1996"},{"key":"10.1006\/jcta.2000.3060_RF4","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF00146828","article-title":"The number of designs with classical parameters grows exponentially","volume":"16","author":"Jungnickel","year":"1984","journal-title":"Geom. Dedicata"},{"key":"10.1006\/jcta.2000.3060_RF5","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0021-9800(69)80088-8","article-title":"Automorphism groups of Hadamard matrices","volume":"6","author":"Kantor","year":"1969","journal-title":"J. Combin. Theory"},{"key":"10.1006\/jcta.2000.3060_RF6","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1023\/A:1022416002358","article-title":"Automorphisms and isomorphisms of symmetric and affine designs","volume":"3","author":"Kantor","year":"1994","journal-title":"J. Algebraic Combin."},{"key":"10.1006\/jcta.2000.3060_RF7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0012-365X(91)90280-F","article-title":"A computer search for finite projective planes of order 9","volume":"92","author":"Lam","year":"1991","journal-title":"Discrete Math."},{"key":"10.1006\/jcta.2000.3060_RF8","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/S0747-7171(89)80029-X","article-title":"Backtrack search with isomorph rejection and consistency check","volume":"7","author":"Lam","year":"1989","journal-title":"J. Symbol. Comput."},{"key":"10.1006\/jcta.2000.3060_RF9","series-title":"Surveys in Combinatorics, 1997","first-page":"51","article-title":"Computer construction of block designs","volume":"241","author":"Lam","year":"1997"},{"key":"10.1006\/jcta.2000.3060_RF10","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0378-3758(96)00018-3","article-title":"Classification of affine resolvable 2-(27, 9, 4) designs","volume":"56","author":"Lam","year":"1996","journal-title":"J. Statist. Plann. Inference"},{"key":"10.1006\/jcta.2000.3060_RF11","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0378-3758(99)00055-5","article-title":"Classification of affine resolvable 2-(27, 9, 4) designs: Corrigendum","volume":"86","author":"Lam","year":"2000","journal-title":"J. Statist. Plann. Inference"},{"key":"10.1006\/jcta.2000.3060_RF12","series-title":"The CRC Handbook of Combinatorial Designs","first-page":"3","article-title":"2-(v,\u00a0k,\u00a0\u03bb) designs of small order","author":"Mathon","year":"1996"},{"key":"10.1006\/jcta.2000.3060_RF13","unstructured":"V. C. Mavron, and, V. D. Tonchev, On symmetric nets and generalized Hadamard matrices from affine designs, preprint."},{"key":"10.1006\/jcta.2000.3060_RF14","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0097-3165(76)90006-6","article-title":"Nonisomorphic Hadamard designs","volume":"21","author":"Norman","year":"1976","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1006\/jcta.2000.3060_RF15","series-title":"Advances in Finite Geometries and Designs","first-page":"359","article-title":"(40, 13, 4) designs obtained from strongly regular graphs","author":"Spence","year":"1991"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316500930607?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316500930607?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T23:53:57Z","timestamp":1557359637000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097316500930607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["S0097316500930607"],"URL":"https:\/\/doi.org\/10.1006\/jcta.2000.3060","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}