Bounds on code distance and efficient fractional factorial experiments

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 1998, Pages 436-

  Ben Gal, I ^a   Levitin, L ^b  

^a BOSTON UNIVERSITY   (United States)

^b Boston University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYTICAL APPROXIMATION; CODE DISTANCE; ERROR CORRECTING CODE; FRACTIONAL FACTORIAL EXPERIMENTS; NUMERICAL RESULTS; SINGLETON BOUND;

INFORMATION THEORY;

EXPERIMENTS;

EID: 0002366851     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.1998.709041     Document Type: Conference Paper

References (3)

1. Bose R. C, "On Some Connections Between the Design of Experiments and Information Theory", Bulletin de L'institut International Statistique, vol. 38, 1961.
2. Delsarte P., "An Algebraic Approach to the Association Scheme of Coding Theory", Philips Research Report Supll., vol. 10, 1973.
3. Sloane N. J. A. and Stufken J., "A Linear Programming Bound for Orthogonal Arrays with Mixed Levels", Journal of Statistical Planning and Inference, vol. 56, 1995.