E    
  D  
    T

Encyclopaedia of DesignTheory: Bibliography

Books | Lecture notes | Papers | Web resources

This page gives a (necessarily incomplete) list of references on design theory. For a much wider list of Web resources, see the Design Resources page.

Books

  1. I. Anderson, Combinatorial Designs and Tournaments, Oxford University Press, Oxford, 1997.
  2. M. Aschbacher, Finite group theory, Cambridge University Press, Cambridge, 1994.
  3. E. F. Assmus Jr and J. D. Key, Codes and Finite Geometries, Cambridge University Press, Cambridge, 1992: Web page
  4. R. A. Bailey, Association Schemes: Designed Experiments, Algebra and Combinatorics, Cambridge University Press, Cambridge, to appear: Web page
  5. E. Bannai and T. Ito, Algebraic Combinatorics I: Association Schemes, Benjamin, New York, 1984.
  6. T. Beth, D. Jungnickel and H. Lenz, Design Theory (2 volumes), Cambridge University Press, Cambridge, 1999.
  7. A. E. Brouwer, A. M. Cohen and A. Neumaier, Distance-regular Graphs, Springer, Berlin, 1989.
  8. K. S. Brown, Buildings, Springer, New York, 1989.
  9. F. Buekenhout (editor), Handbook of Incidence Geometry, North-Holland, Amsterdam, 1995.
  10. T. Calinski and S. Kageyama, Block Designs: A Randomization Approach, Lecture Notes in Statistics 150, Springer, New York, 2000.
  11. P. J. Cameron, Permutation Groups, Cambridge University Press, Cambridge, 1999: Web page
  12. P. J. Cameron and J. H. van Lint, Designs, Graphs, Codes and their Links, Cambridge University Press, Cambridge, 1991.
  13. R. W. Carter, Simple Groups of Lie Type, Wiley Interscience, New York, 1972.
  14. W. G. Cochran and G. M. Cox, Experimental Designs, Wiley, New York, 1950.
  15. C. Colbourn and J. Dinitz (editors), The Handbook of Combinatorial Design, CRC Press, 1996: Web page
  16. G. M. Constantine, Combinatorial Theory and Statistical Design, Wiley, New York, 1987.
  17. J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker, and R. A. Wilson, An ATLAS of Finite Groups, Oxford University Press, Oxford, 1985.
  18. D. R. Cox, Planning of Experiments, Wiley, New York, 1958.
  19. B. A. Davey and H. A. Priestley, Introduction to Lattices and Order, Cambridge University Press, Cambridge, 1990.
  20. P. Dembowski, Finite Geometries, Springer, Berlin, 1968.
  21. J. Dénes and A. D. Keedwell, Latin squares and their applications, Akademiai Kiado, Budapest, 1974.
  22. J. Dénes and A. D. Keedwell (editors), Latin squares: New developments in the theory and applications, Annals of Discrete Mathematics, 46, North-Holland, Amsterdam, 1991.
  23. A. Dey, Theory of Block Designs, Wiley Eastern, New Delhi, 1986.
  24. J. H. Dinitz and D. R. Stinson (editors), Contemporary Design Theory: A Collection of Surveys, Wiley, New York, 1992.
  25. D. J. Finney, An Introduction to the Theory of Experimental Design, University of Chicago Press, Chicago, 1960.
  26. R. A. Fisher, The Design of Experiments, Oliver and Boyd, Edinburgh, 1935.
  27. J. A. Gallian, Contemporary Abstract Algebra, Houghton Mifflin, Boston, 1998.
  28. C. D. Godsil, Algebraic combinatorics, Chapman & Hall, New York, 1993.
  29. R. L. Graham, M. Grötschel and L. Lovász (editors), Handbook of Combinatorics, North-Holland, Amsterdam, 1995.
  30. Charles M. Grinstead and J. Laurie Snell, Introduction to Probability (Web-based book)
  31. M. Hall Jr., Combinatorial Theory, Wiley, New York, 1986.
  32. A. S. Hedayat, N. J. A. Sloane and John Stufken, Orthogonal Arrays: Theory and Applications, Springer, Berlin, 1999: Web page
  33. R. Hill, A First Course in Coding Theory, Oxford University Press, Oxford, 1986.
  34. J. W. P. Hirschfeld, Projective Geometries over Finite Fields (second edition), Oxford University Press, Oxford, 1998: Web page
  35. J. W. P. Hirschfeld, Finite Projective Spaces of Three Dimensions, Oxford University Press, Oxford, 1985.
  36. J. W. P. Hirschfeld and J. A. Thas, General Galois Geometries, Oxford University Press, Oxford, 1991.
  37. D. R. Hughes and F. C. Piper, Design Theory, Cambridge University Press, Cambridge, 1985.
  38. J. E. Humphreys, Reflection Groups and Coxeter Groups, Cambridge Univ. Press, Cambridge, 1990.
  39. J. A. John, Cyclic Designs, Chapman and Hall, London, 1987.
  40. O. Kempthorne, Design and Analysis of Experiments, Wiley, New York, 1952.
  41. R. Lidl and H. Niederreiter, Finite Fields, Cambridge University Press, Cambridge, 1996.
  42. C. C. Lindner and A. Rosa (editors), Topics in Steiner systems, Ann. Discrete Math. 7, Elsevier, Amsterdam, 1979.
  43. J. H. van Lint, Introduction to Coding Theory, Springer, New York, 1982.
  44. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
  45. J. D. Malley, Optimal Unbiased Estimation of Variance Components, Lecture Notes in Statistics 39, Springer, Berlin, 1986.
  46. A. Pasini, Diagram Geometries, Oxford University Press, Oxford, 1994.
  47. V. Pless, Introduction to the Theory of Error-correcting Codes, Wiley, New York, 1982.
  48. D. Raghavarao, Constructions and Combinatorial Problems in Design of Experiments, Wiley, New York, 1971.
  49. M. A. Ronan, Lectures on Buildings, Academic Press, Boston, 1989.
  50. K. R. Shah and B. K. Sinha, Theory of Optimal Designs, Springer, New York, 1989.
  51. M. S. Shrikhande and S. S. Sane, Quasi-symmetric designs, London Mathematical Society Lecture Note Series 164, Cambridge University Press, Cambridge, 1991.
  52. A. P. Street and D. J. Street, Combinatorics of Experimental Design, Oxford University Press, Oxford, 1987.
  53. J. Tits, Buildings of Spherical Type and Finite BN-Pairs, Springer, Berlin, 1974.
  54. D. J. A. Welsh, Matroid Theory, Academic Press, London, 1976.
  55. D. J. A. Welsh, Codes and Cryptography, Oxford University Press, Oxford, 1988.

Lecture notes on the Web
  1. Ian Anderson and Iiro Honkala, A short course on combinatorial designs
  2. R. A. Bailey, Notes on designing an experiment
  3. Francis Buekenhout, History and prehistory of polar spaces and of generalized quadrangles
  4. Peter J. Cameron, Finite geometry and coding theory
  5. Peter J. Cameron, Classical groups
  6. Peter J. Cameron, Projective and polar spaces
  7. Peter J. Cameron, Polynomial aspects of codes, matroids and permutation groups
  8. Bill Cherowitzo, Combinatorial structures
  9. J. Eisfeld and L. Storme, (Partial) t-spreads and minimal t-covers in finite projective spaces
  10. Willem H. Haemers, Matrix techniques for strongly regular graphs and related geometries
  11. J. I. Hall, Notes on coding theory
  12. Steven R. Pagano, Matroids and signed graphs
  13. D. R. Stinson, Combinatorial designs with selected applications
  14. J. A. Thas and H. Van Maldeghem, Embeddings of geometries in finite projective spaces

Papers
  1. L. Babai, Almost all Steiner triple systems are asymmetric, in Topics in Steiner systems (ed. C. C. Lindner and A. Rosa), Ann. Discrete Math. 7, Elsevier, Amsterdam, 1979, pp. 37-39.
  2. R. A. Bailey, Orthogonal partitions for designed experiments, Designs, Codes and Cryptography 8 (1996), 45-77.
  3. R. C. Bose, On some new series of balanced incomplete block designs, Bull. Calcutta Math. Soc. 34 (1942), 17-31.
  4. R. C. Bose and K. R. Nair, Partially balanced incomplete block designs, Sankhya 4 (1939), 337-372.
  5. F. Buekenhout, Diagrams for geometries and groups, J. Combinatorial Theory (A) 27 (1979), 121-151.
  6. M. C. Chakrabarti, On the C-matrix in design of experiments, J. Indian Statist. Assoc. 1 (1963), 8-23.
  7. Ph. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Research Reports Suppl. 10 (1973).
  8. A. Dey, M. Singh and G. M. Saha, Efficiency balanced block designs, Commun. Statist. (A) 10 (1981), 237-247.
  9. J. Doyen and R. M. Wilson, Embeddings of Steiner triple systems, Discrete Math. 5 (1973), 229-239.
  10. R. A. Fisher, An examination of the different possible solutions of a problem in incomplete blocks, Ann. Eugenics 10 (1940), 52-75.
  11. M. Hall, Jr., Automorphisms of Steiner triple systems, IBM J. Research Develop. 4 (1960), 460-472.
  12. M. Hall, Jr., Note on the Mathieu group M12, Arch. Math. 13 (1962), 334-340.
  13. M. T. Jacobson and P. Matthews, Generating uniformly distributed random Latin squares, J. Combinatorial Design 4 (1996), 405-437.
  14. M. R. Jerrum, Computational Pólya theory, pp. 103-118 in Surveys in Combinatorics, 1995 (Peter Rowlinson, ed.), London Math. Soc. Lecture Notes 218, Cambridge University Press, Cambridge, 1995.
  15. D. A. Preece, Orthogonality and designs: a terminological muddle, Utilitas Math. 12 (1977), 201-223.
  16. D. A. Preece, Balance and designs: Another terminological tangle, Utilitas Math. 21C (1982), 85-186; correction, ibid. 23 (1983), 347.
  17. D. A. Preece, Balanced Ouchterlony neighbour designs and quasi Rees neighbour designs, J. Combinatorial Mathematics and Combinatorial Computing 15 (1994), 197--219.
  18. V. R. Rao, A note on balanced designs, Ann. Math. Statist. 29 (1958), 290-294.
  19. D. K. Ray-Chaudhuri and R. M. Wilson, Solution of Kirkman's schoolgirl problem, Combinatorics, Proc. Symp. Pure Math. 19, 187-203 (1971).
  20. G.-C. Rota, On the foundations of combinatorial theory, I: Theory of Möbius functions, Z. Wahrscheinlichkeitstheorie 2 (1964), 340-368.
  21. J. Seberry and M. Yamada, Hadamard matrices, sequences and block designs, pp. 431-560 in Contemporary Design Theory: A Collection of Surveys (ed. J. H. Dinitz and D. R. Stinson), Wiley, New York, 1992.
  22. R. M. Wilson, Non-isomorphic Steiner triple systems, Math. Z. 135 (1974), 303-313.
  23. R. M. Wilson, An existence theory for pairwise balanced designs: I, Composition theorems and morphisms, J. Combinatorial Theory (A) 13 (1972), 220-245; II, The structure of PBD-closed sets and the existence conjectures, ibid. 13 (1972), 246-273; III, A proof of the existence conjectures, ibid. 18 (1975), 71-79.
  24. R. M. Wilson, Construction and uses of pairwise balanced designs, Mathematical Centre Tracts 55, Mathematisch Centrum, Amsterdam, 1974.

Other Web resources
  1. 100 years of design theory in Biometrika: an annotated bibliography by A. C. Atkinson and R. A. Bailey
  2. Semi-Latin squares page (maintained by R. A. Bailey)
  3. Neighbour-balanced designs page (maintained by R. A. Bailey)
  4. Fractional factorial design generator by Marko Boon
  5. Permutation groups resources (maintained by Peter J. Cameron)
  6. Hyperoval Page (maintained by Bill Cherowitzo)
  7. Flocks of Cones (maintained by Bill Cherowitzo)
  8. Design Links (maintained by Jeff Dinitz)
  9. Design and Analysis of Experiments at the Horticultural Research Institute (maintained by Rodney N. Edmondson)
  10. Small association schemes (maintained by A. Hanaki)
  11. Matroids page (maintained by Sandra Kingan)
  12. Design Computing (software, courses, consulting, research) by Nam-Ky Nguyen
  13. Virtual Laboratories in Probability and Statistics (maintained by Kyle Siegrist)
  14. Library of Orthogonal Arrays (maintained by Neil Sloane)
  15. Partial Spreads page (maintained by Leonard Soicher)
  16. SOMAs page (maintained by Leonard Soicher)
  17. Ted Spence's files: designs, strongly regular graphs, Hadamard matrices, etc.
  18. Matroid Miscellany (maintained by Thomas Zaslavsky)

Table of contents | Glossary | Topics | Bibliography | History

Peter J. Cameron
26 October 2002