Construction of Asymmetric Orthogonal Arrays of Strength t from Orthogonal Partition of Small Orthogonal Arrays
Summary :
In this study, we developed a new orthogonal partition concept for asymmetric orthogonal arrays and used it for the construction of orthogonal arrays for the first time. Permutation matrices and the Kronecker product were also successfully and skillfully used as our main tools. Hence, a new general iterative construction method for asymmetric orthogonal arrays of high strength was developed, and some new infinite families of orthogonal arrays of strength 3 and several new orthogonal arrays of strength 4, 5, and 6 were obtained.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E101-A No.8 pp.1267-1272
- Publication Date
- 2018/08/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E101.A.1267
- Type of Manuscript
- LETTER
- Category
- Information Theory
Authors
Shanqi PANG
Henan Normal University
Xiao LIN
Henan Normal University
Jing WANG
Henan Normal University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Shanqi PANG, Xiao LIN, Jing WANG, "Construction of Asymmetric Orthogonal Arrays of Strength t from Orthogonal Partition of Small Orthogonal Arrays" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 8, pp. 1267-1272, August 2018, doi: 10.1587/transfun.E101.A.1267.
Abstract: In this study, we developed a new orthogonal partition concept for asymmetric orthogonal arrays and used it for the construction of orthogonal arrays for the first time. Permutation matrices and the Kronecker product were also successfully and skillfully used as our main tools. Hence, a new general iterative construction method for asymmetric orthogonal arrays of high strength was developed, and some new infinite families of orthogonal arrays of strength 3 and several new orthogonal arrays of strength 4, 5, and 6 were obtained.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.1267/_p
Copy
@ARTICLE{e101-a_8_1267,
author={Shanqi PANG, Xiao LIN, Jing WANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Construction of Asymmetric Orthogonal Arrays of Strength t from Orthogonal Partition of Small Orthogonal Arrays},
year={2018},
volume={E101-A},
number={8},
pages={1267-1272},
abstract={In this study, we developed a new orthogonal partition concept for asymmetric orthogonal arrays and used it for the construction of orthogonal arrays for the first time. Permutation matrices and the Kronecker product were also successfully and skillfully used as our main tools. Hence, a new general iterative construction method for asymmetric orthogonal arrays of high strength was developed, and some new infinite families of orthogonal arrays of strength 3 and several new orthogonal arrays of strength 4, 5, and 6 were obtained.},
keywords={},
doi={10.1587/transfun.E101.A.1267},
ISSN={1745-1337},
month={August},}
Copy
TY - JOUR
TI - Construction of Asymmetric Orthogonal Arrays of Strength t from Orthogonal Partition of Small Orthogonal Arrays
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1267
EP - 1272
AU - Shanqi PANG
AU - Xiao LIN
AU - Jing WANG
PY - 2018
DO - 10.1587/transfun.E101.A.1267
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2018
AB - In this study, we developed a new orthogonal partition concept for asymmetric orthogonal arrays and used it for the construction of orthogonal arrays for the first time. Permutation matrices and the Kronecker product were also successfully and skillfully used as our main tools. Hence, a new general iterative construction method for asymmetric orthogonal arrays of high strength was developed, and some new infinite families of orthogonal arrays of strength 3 and several new orthogonal arrays of strength 4, 5, and 6 were obtained.
ER -
English
