# A note on automatic construction algorithms for orthogonal designs of experiments using error-correcting codes

Tomohiko Saito, Toshiyasu Matsushima, Shigeichi Hirasawa

Research output: Contribution to journalArticle

### Abstract

In the field of experimental design, it is important to construct orthogonal designs. In this paper, we propose a new algorithm to construct orthogonal design. This algorithm uses Ukita's algorithm, which is essentially based on projective geometries, and uses orthogonal designs constructed by error-correcting codes. We show some numerical examples of the proposed algorithm, and show that the proposed algorithm can construct good orthogonal designs with low complexity even if there are high order effects.

Original language English 369-381 13 Journal of Discrete Mathematical Sciences and Cryptography 13 4 Published - 2010 Aug

### Fingerprint

Orthogonal Design
Error-correcting Codes
Design of Experiments
Design of experiments
Projective geometry
Experimental design
Low Complexity
Higher Order
Numerical Examples
Geometry

### Keywords

• Error-correcting codes
• Experimental design
• Orthogonal designs

### ASJC Scopus subject areas

• Algebra and Number Theory
• Analysis
• Applied Mathematics

### Cite this

A note on automatic construction algorithms for orthogonal designs of experiments using error-correcting codes. / Saito, Tomohiko; Matsushima, Toshiyasu; Hirasawa, Shigeichi.

In: Journal of Discrete Mathematical Sciences and Cryptography, Vol. 13, No. 4, 08.2010, p. 369-381.

Research output: Contribution to journalArticle

@article{6a2bc97cc29d4cf18b8e0661b69cd25e,
title = "A note on automatic construction algorithms for orthogonal designs of experiments using error-correcting codes",
abstract = "In the field of experimental design, it is important to construct orthogonal designs. In this paper, we propose a new algorithm to construct orthogonal design. This algorithm uses Ukita's algorithm, which is essentially based on projective geometries, and uses orthogonal designs constructed by error-correcting codes. We show some numerical examples of the proposed algorithm, and show that the proposed algorithm can construct good orthogonal designs with low complexity even if there are high order effects.",
keywords = "Error-correcting codes, Experimental design, Orthogonal designs",
author = "Tomohiko Saito and Toshiyasu Matsushima and Shigeichi Hirasawa",
year = "2010",
month = "8",
language = "English",
volume = "13",
pages = "369--381",
journal = "Journal of Discrete Mathematical Sciences and Cryptography",
issn = "0972-0529",
publisher = "TARU Publications",
number = "4",

}

TY - JOUR

T1 - A note on automatic construction algorithms for orthogonal designs of experiments using error-correcting codes

AU - Saito, Tomohiko

AU - Matsushima, Toshiyasu

AU - Hirasawa, Shigeichi

PY - 2010/8

Y1 - 2010/8

N2 - In the field of experimental design, it is important to construct orthogonal designs. In this paper, we propose a new algorithm to construct orthogonal design. This algorithm uses Ukita's algorithm, which is essentially based on projective geometries, and uses orthogonal designs constructed by error-correcting codes. We show some numerical examples of the proposed algorithm, and show that the proposed algorithm can construct good orthogonal designs with low complexity even if there are high order effects.

AB - In the field of experimental design, it is important to construct orthogonal designs. In this paper, we propose a new algorithm to construct orthogonal design. This algorithm uses Ukita's algorithm, which is essentially based on projective geometries, and uses orthogonal designs constructed by error-correcting codes. We show some numerical examples of the proposed algorithm, and show that the proposed algorithm can construct good orthogonal designs with low complexity even if there are high order effects.

KW - Error-correcting codes

KW - Experimental design

KW - Orthogonal designs

UR - http://www.scopus.com/inward/record.url?scp=78651559433&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78651559433&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:78651559433

VL - 13

SP - 369

EP - 381

JO - Journal of Discrete Mathematical Sciences and Cryptography

JF - Journal of Discrete Mathematical Sciences and Cryptography

SN - 0972-0529

IS - 4

ER -