{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T21:10:18Z","timestamp":1737321018241,"version":"3.33.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2007,7,21]],"date-time":"2007-07-21T00:00:00Z","timestamp":1184976000000},"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":[[2007,8,31]]},"DOI":"10.1007\/s10623-007-9092-3","type":"journal-article","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T15:26:06Z","timestamp":1184945166000},"page":"223-238","source":"Crossref","is-referenced-by-count":2,"title":["What is a design? How should we classify them?"],"prefix":"10.1007","volume":"44","author":[{"given":"R. A.","family":"Bailey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J.","family":"Cameron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,7,21]]},"reference":[{"key":"9092_CR1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198500292.001.0001","volume-title":"Combinatorial designs and tournaments","author":"I Anderson","year":"1997","unstructured":"Anderson I (1997). Combinatorial designs and tournaments. Oxford University Press, Oxford"},{"key":"9092_CR2","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522546.001.0001","volume-title":"Optimum experimental designs","author":"AC Atkinson","year":"1992","unstructured":"Atkinson AC and Donev AN (1992). Optimum experimental designs. Oxford University Press, Oxford"},{"key":"9092_CR3","first-page":"85","volume":"36","author":"RA Bailey","year":"1999","unstructured":"Bailey RA (1999). Choosing designs for nested blocks. Listy Biometryczne 36: 85\u2013126","journal-title":"Listy Biometryczne"},{"key":"9092_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511610882","volume-title":"Association schemes: designed experiments, algebra and combinatorics","author":"RA Bailey","year":"2004","unstructured":"Bailey RA (2004). Association schemes: designed experiments, algebra and combinatorics. Cambridge University Press, Cambridge"},{"key":"9092_CR5","doi-asserted-by":"crossref","first-page":"3014","DOI":"10.1016\/j.disc.2004.10.027","volume":"306","author":"RA Bailey","year":"2006","unstructured":"Bailey RA, Cameron PJ, Dobcs\u00e1nyi P, Morgan JP and Soicher LH (2006). Designs on the Web. Discrete Math 306: 3014\u20133027","journal-title":"Discrete Math"},{"key":"9092_CR6","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1214\/aos\/1176350039","volume":"14","author":"RA Bailey","year":"1986","unstructured":"Bailey RA and Speed TP (1986). Rectangular lattice designs: efficiency factors and analysis. Ann Stat 14: 874\u2013895","journal-title":"Ann Stat"},{"key":"9092_CR7","unstructured":"Brouwer AE, van Lint JH (1984) Strongly regular graphs and partial geometries. In: Enumeration and design. Academic Press, Toronto, pp 85\u2013122"},{"key":"9092_CR8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0097-3165(79)90041-4","volume":"27","author":"F Buekenhout","year":"1979","unstructured":"Buekenhout F (1979). Diagrams for geometries and groups. J. Combin Theory (A) 27: 121\u2013151","journal-title":"J. Combin Theory (A)"},{"key":"9092_CR9","unstructured":"Cameron PJ (1991) Projective and polar spaces. QMW Maths Notes vol 13. Queen Mary and Westfield College, London. Second edition available at http:\/\/www.maths.qmul.ac.uk\/\u223cpjc\/pps\/"},{"key":"9092_CR10","unstructured":"Cameron PJ (ed) Encyclopaedia of design theory, http:\/\/designtheory.org\/library\/encyc\/"},{"key":"9092_CR11","doi-asserted-by":"crossref","unstructured":"Colbourn CJ, Dinitz JH (ed) (1996) Handbook of combinatorial designs, 1st edn. Chapman & Hall\/CRC","DOI":"10.1201\/9781420049954"},{"key":"9092_CR12","unstructured":"Design Theory Resource Server, http:\/\/designtheory.org\/"},{"key":"9092_CR13","doi-asserted-by":"crossref","unstructured":"Deza M (1992) Perfect matroid designs. In: White N (ed) Matroid applications. Encyc Math Appl vol 40. Cambridge University Press, pp 54\u201372","DOI":"10.1017\/CBO9780511662041.003"},{"key":"9092_CR14","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1093\/biomet\/62.2.341","volume":"62","author":"JA Eccleston","year":"1975","unstructured":"Eccleston JA and Russell KG (1975). Connectedness and orthogonality in multi-factor designs. Biometrika 62: 341\u2013345","journal-title":"Biometrika"},{"key":"9092_CR15","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1111\/j.1469-1809.1941.tb02298.x","volume":"11","author":"RA Fisher","year":"1942","unstructured":"Fisher RA (1942). The theory of confounding in factorial experiments in relation to the theory of groups. Ann Eugen 11: 341\u2013353","journal-title":"Ann Eugen"},{"key":"9092_CR16","unstructured":"Hanaki A, Miyamoto I. Classification of association schemes with small vertices, http:\/\/kissme.shinshu-u.ac.jp\/as\/"},{"key":"9092_CR17","doi-asserted-by":"crossref","unstructured":"Hughes DR (1962) Combinatorial analysis: t-designs and permutation groups. In: Proceedings of the symposium in pure mathematics 6. American Mathematical Society, Providence, Rhode Island, pp 39\u201341","DOI":"10.1090\/pspum\/006\/0133372"},{"key":"9092_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511566066","volume-title":"Design theory","author":"DR Hughes","year":"1985","unstructured":"Hughes DR and Piper FC (1985). Design theory. Cambridge University Press, Cambridge"},{"key":"9092_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-7220-0","volume-title":"Cyclic and computer-generated designs","author":"JA John","year":"1995","unstructured":"John JA and Williams ER (1995). Cyclic and computer-generated designs. Chapman and Hall, London"},{"key":"9092_CR20","doi-asserted-by":"crossref","first-page":"2993","DOI":"10.1016\/j.disc.2004.07.043","volume":"306","author":"GB Khosrovshahi","year":"2006","unstructured":"Khosrovshahi GB and Tayfeh-Rezaie B (2006). Large sets of t-designs through partitionable sets: a survey. Discrete Math 306: 2993\u20133004","journal-title":"Discrete Math"},{"key":"9092_CR21","unstructured":"La Jolla Covering Repository, http:\/\/www.ccrwest.org\/cover.html"},{"key":"9092_CR22","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/jcd.10020","volume":"10","author":"PC Li","year":"2002","unstructured":"Li PC and van Rees GHJ (2002). Lotto design tables. J Combin Designs 10: 335\u2013359","journal-title":"J Combin Designs"},{"key":"9092_CR23","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10623-003-6149-9","volume":"35","author":"JP McSorley","year":"2005","unstructured":"McSorley JP, Phillips NCK, Wallis WD and Yucas JL (2005). Double arrays, triple arrays and balanced grids. Designs, Codes Cryptogr 35: 21\u201345","journal-title":"Designs, Codes Cryptogr"},{"key":"9092_CR24","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S0012-365X(00)00332-0","volume":"231","author":"JP Morgan","year":"2001","unstructured":"Morgan JP, Preece DA and Rees DH (2001). Nested balanced incomplete block designs. Discrete Math 231: 351\u2013389","journal-title":"Discrete Math"},{"key":"9092_CR25","doi-asserted-by":"crossref","first-page":"303","DOI":"10.2307\/2343525","volume":"30","author":"JA Nelder","year":"1968","unstructured":"Nelder JA (1968). The combination of information in generally balanced designs. J Roy Stat Soc, Ser B 30: 303\u2013311","journal-title":"J Roy Stat Soc, Ser B"},{"key":"9092_CR26","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198534976.001.0001","volume-title":"Diagram geometries","author":"A Pasini","year":"1994","unstructured":"Pasini A (1994). Diagram geometries. Oxford University Press, Oxford"},{"key":"9092_CR27","first-page":"7","volume-title":"Combinatorial Mathematics IV Lecture Notes in Mathematics, vol 560.","author":"DA Preece","year":"1976","unstructured":"Preece DA (1976). Non-orthogonal Graeco-Latin designs. In: Casse, LRA and Wallis, WD (eds) Combinatorial Mathematics IV Lecture Notes in Mathematics, vol 560., pp 7\u201326. Springer, Berlin"},{"key":"9092_CR28","first-page":"65","volume":"26","author":"DA Preece","year":"1990","unstructured":"Preece DA (1990). Fifty years of Youden squares: a review. Bull Inst Math Appl 26: 65\u201375","journal-title":"Bull Inst Math Appl"},{"key":"9092_CR29","first-page":"65","volume":"25","author":"DA Preece","year":"1997","unstructured":"Preece DA and Phillips NCK (1997). A new type of Freeman-Youden rectangle. J Combin Math Combin Comput 25: 65\u201378","journal-title":"J Combin Math Combin Comput"},{"key":"9092_CR30","volume-title":"Optimal design of experiments","author":"F Pukelsheim","year":"1993","unstructured":"Pukelsheim F (1993). Optimal design of experiments. Wiley, New York"},{"key":"9092_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-3662-7","volume-title":"Theory of optimal designs","author":"KR Shah","year":"1989","unstructured":"Shah KR and Sinha BK (1989). Theory of optimal designs. Springer, New York"},{"key":"9092_CR32","unstructured":"Soicher LH SOMA Update, http:\/\/www.maths.qmul.ac.uk\/\u223cleonard\/soma\/"},{"key":"9092_CR33","volume-title":"Buildings of spherical type and finite BN-pairs. Lecture Notes in Math vol 382","author":"J Tits","year":"1974","unstructured":"Tits J (1974). Buildings of spherical type and finite BN-pairs. Lecture Notes in Math vol 382. Springer-Verlag, Berlin"},{"key":"9092_CR34","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1111\/j.2517-6161.1976.tb01598.x","volume":"38","author":"ER Williams","year":"1976","unstructured":"Williams ER, Patterson HD and John JA (1976). Resolvable designs with two replications. J Roy Stat Soc, Ser B 38: 296\u2013301","journal-title":"J Roy Stat Soc, Ser B"},{"key":"9092_CR35","doi-asserted-by":"crossref","unstructured":"Yates F (1935) Complex experiments. J Roy Stat Soc, Suppl 2:181\u2013247","DOI":"10.2307\/2983638"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9092-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-007-9092-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9092-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T20:38:37Z","timestamp":1737319117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-007-9092-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,21]]},"references-count":35,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2007,8,31]]}},"alternative-id":["9092"],"URL":"https:\/\/doi.org\/10.1007\/s10623-007-9092-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2007,7,21]]}}}