The Annals of Statistics

Construction of E(s2)-optimal supersaturated designs

Dursun A. Bulutoglu and Ching-Shui Cheng

Full-text: Open access


Booth and Cox proposed the E(s2) criterion for constructing two-level supersaturated designs. Nguyen [Technometrics 38 (1996) 69–73] and Tang and Wu [Canad. J. Statist 25 (1997) 191–201] independently derived a lower bound for E(s2). This lower bound can be achieved only when m is a multiple of N−1, where m is the number of factors and N is the run size. We present a method that uses difference families to construct designs that satisfy this lower bound. We also derive better lower bounds for the case where the Nguyen–Tang–Wu bound is not achievable. Our bounds cover more cases than a bound recently obtained by Butler, Mead, Eskridge and Gilmour [J. R. Stat. Soc. Ser. B Stat. Methodol. 63 (2001) 621–632]. New E(s2)-optimal designs are obtained by using a computer to search for designs that achieve the improved bounds.

Article information

Ann. Statist., Volume 32, Number 4 (2004), 1662-1678.

First available in Project Euclid: 4 August 2004

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 62K15: Factorial designs
Secondary: 62K10: Block designs

Balanced incomplete block designs difference families effect sparsity Hadamard matrices


Bulutoglu, Dursun A.; Cheng, Ching-Shui. Construction of E ( s 2 )-optimal supersaturated designs. Ann. Statist. 32 (2004), no. 4, 1662--1678. doi:10.1214/009053604000000472.

Export citation


  • Beth, T., Jungnickel, D. and Lenz, H. (1999). Design Theory 1, 2nd ed., Cambridge Univ. Press.
  • Booth, K. H. V. and Cox, D. R. (1962). Some systematic supersaturated designs. Technometrics 4 489–495.\goodbreak
  • Butler, N. A., Mead, R., Eskridge, K. M. and Gilmour, S. G. (2001). A general method of constructing $E(s^2)$-optimal supersaturated designs. J. R. Stat. Soc. Ser. B Stat. Methodol. 63 621–632.
  • Cheng, C. S. (1997). $E(s^2)$-optimal supersaturated designs. Statist. Sinica 7 929–939.
  • Eskridge, K. M., Gilmour, S. G., Mead, R., Butler, N. and Travnicek, D. A. (2001). Cyclic supersaturated designs. Preprint.
  • Li, W. W. and Wu, C. F. J. (1997). Columnwise–pairwise algorithms with applications to the construction of supersaturated designs. Technometrics 39 171–179.
  • Lin, D. K. J. (1993). A new class of supersaturated designs. Technometrics 35 28–31.
  • Lin, D. K. J. (1995). Generating systematic supersaturated designs. Technometrics 37 213–225.
  • Liu, Y. and Dean, A. M. (2002). $k$-circulant supersaturated designs. Preprint.
  • Nguyen, N.-K. (1996). An algorithmic approach to constructing supersaturated designs. Technometrics 38 69–73.
  • Tang, B. and Wu, C. F. J. (1997). A method for constructing supersaturated designs and its $E(s^2)$-optimality. Canad. J. Statist. 25 191–201.
  • Wilson, R. M. (1972). Cyclotomy and difference families in elementary abelian groups. J. Number Theory 4 17–47.
  • Wu, C. F. J. (1993). Construction of supersaturated designs through partially aliased interactions. Biometrika 80 661–669.