An application of information theory and error-correcting codes to fractional factorial experiments

Journal of Statistical Planning and Inference

Volumn 92, Issue 1-2, 2001, Pages 267-282

  Ben Gal, Irad ^a   Levitin, Lev B ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b Boston University   (United States)

Author keywords

62B10; 62K15; Coding theory; Design of experiments; H optimal designs; Information in experiments

Indexed keywords

EID: 0000050574     PISSN: 03783758     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0378-3758(00)00165-8     Document Type: Article

References (25)

1. Ben-Gal I., Caramanis M. A stochastic dynamic programming framework for an efficient adaptive design of experiments. Mimeograph Series No. 23B-98. ADMS Lab. 1998;Boston University, Boston, MA.
2. Ben-Gal, I., Levitin, L.B., 1998. Bounds on code distance and efficient fractional factorial experiments. Proceedings of the 1998 IEEE International Symposium on Information Theory, Boston, MA, 1998, p. 436.
3. Bose, R.C., 1950. Mathematics of factorial designs. Proceeding of the International Congress of Mathematicians, Vol. 1, pp. 543-548.
4. Bose R.C. On some connections between the design of experiments and information theory. Bull. Inst. Internat. Statist. 38:1961;257-271.
5. Box G.E.P., Draper N.R. Fractional designs, the. |X′X| criterion, and some related matters Technometrics. 13(4):1971;731-742.
6. Box G.E.P., Hill W.J. Discrimination among mechanistic models. Technometrics. 9(1):1967;57-71.
7. Cover T.M., Thomas J.A. Elements of Information Theory. 1991;Wiley, New York.
8. Delsarte, P., 1973. An algebraic approach to the association scheme of coding theory. Philips Res. Rep. 10 (Suppl.) 1-97.
9. Fedorov V.V. Theory of Optimal Experiments. 1972;Academic Press, New York.
10. Finney D.J. The fractional replications of factorial arrangements. Ann. Eugen. Lond. 12:1945;291-301.
11. Gilbert E.N. A comparison of signaling alphabets. Bell System Tech. J. 31:1952;504-522.
12. Hardin R.H., Sloane N.J.A. A new approach to the construction of optimal designs. J. Statist. Plann. Inference. 37:1993;339-369.
13. Keiefer J., Wolfowitz J. Optimum designs in regression problems. Ann. Math. Statist. 30:1959;271-294.
14. Kishen K. On fractional replication of the general symmetrical factorial design. J. Indian Soc. Agricultural Statist. 1:1948;91-106.
15. Macwilliams F.J., Sloane N.J.A. The Theory of Error-Correcting Codes. 1977;North-Holland, Amsterdam.
16. Montgomery D.C. Design and Analysis of Experiments. 1991;Wiley, New York.
17. Myers R.H., Montgomery D.C. Response Surface Methodology. 1995;Wiley, New York.
18. Reed I.S., Solomon G. Polynomial codes over certain finite fields. J. SIAM. 8:1960;300-304.
19. Shannon, C.E., 1948. A mathematical theory of communication. Bell Systems Tech. J. 27 part I, 379-423; part II, 623-656.
20. Singleton R.C. Maximum distance. Q -ary codes IEEE Trans. Inform. Theory. 10:1964;116-118.
21. Sloane, N.J.A., 1994. Application of error-correcting codes to orthogonal arrays and the design of experiments. Proceedings of the IEEE International Symposium on Information Theory, p. 104.
22. Sloane N.J.A., Stufken J. A linear programming bound for orthogonal arrays with mixed levels. J. Statist. Plann. Inference. 56(2):1996;295-305.
23. St. John R.C., Draper N.R. D -optimality for regression designs: a review Technometrics. 17:1975;15-23.
24. Wicket S.B. Error Control Systems for Digital Communication and Storage. 1995;Prentice-Hall, Englewood Cliffs, NJ.
25. Wynn H.P. The sequential generation of. D -optimum experimental designs Ann. Math. Statist. 41:1970;1655-1664.