Bounds on code distance and efficient fractional factorial experiments

I. Ben-Gal, L. Levitin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

The results presented in this paper are based on the correspondence between error-correcting codes and fractional factorial experiments. It is shown that under certain conditions, one can attain a smaller fractional factorial experiment by increasing the number of levels associated with each factor. The Gilbert-Varshamov and the Singleton bounds are used to obtain bounds on the size of the fractional experiment. Analytical approximations and numerical results are presented.

Original languageEnglish
Title of host publicationProceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998
Pages436
Number of pages1
DOIs
StatePublished - 1998
Externally publishedYes
Event1998 IEEE International Symposium on Information Theory, ISIT 1998 - Cambridge, MA, United States
Duration: 16 Aug 199821 Aug 1998

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1998 IEEE International Symposium on Information Theory, ISIT 1998
Country/TerritoryUnited States
CityCambridge, MA
Period16/08/9821/08/98

Fingerprint

Dive into the research topics of 'Bounds on code distance and efficient fractional factorial experiments'. Together they form a unique fingerprint.

Cite this