Some binary maximin distance designs

Journal of Statistical Planning and Inference

Volumn 88, Issue 1, 2000, Pages 149-170

  Duckworth II, William Maury ^a  

^a Iowa State University   (United States)

Author keywords

05B40; 62K05; Coding theory; Computer experiments; Optimal designs; Space filling designs

Indexed keywords

EID: 0042207338     PISSN: 03783758     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0378-3758(99)00183-4     Document Type: Article

References (8)

1. Brouwer A.E., Shearer J.B., Sloane N.J.A., Smith W.D. A new table of constant weight codes. IEEE Trans. Inform. Theory. 36:1990;1334-1380.
2. Conway, J.H., Sloane, N.J.A., 1993. Sphere Packings, Lattices, and Groups, 2nd Edition. Springer, Berlin.
3. Helgert H.J., Stinaff R.D. Minimum-distance bounds for binary linear codes. IEEE Trans. Inform. Theory. 19:1973;344-356.
4. John P.W.M., Johnson M.E., Moore L.M., Ylvisaker D. Minimax distance designs in two-level factorial experiments. J. Statist. Plann. Inference. 44:1995;249-263.
5. Johnson M.E., Moore L.M., Ylvisaker D. Minimax and maximin distance designs. J. Statist. Plann. Inference. 26:1990;131-148.
6. Kaikkonen M.K. A new four-error correcting code of length 20. IEEE Trans. Inform. Theory. 35:1989;1344.
7. MacWilliams, F.J., Sloane, N.J.A., 1977. The Theory of Error-Correcting Codes. North-Holland, Amsterdam.
8. Morris M.D., Mitchell T.J., Ylvisaker D. Bayesian design and analysis of computer experiments: use of derivatives in surface prediction. Technometrics. 35:1993;243-255.