IEICE TRANSACTIONS on Fundamentals
Iterative Constructions of Orthogonal Arrays of Strength t and Orthogonal Partitions
Summary :
Orthogonal arrays and orthogonal partitions have great significance in communications and coding theory. In this letter, by using a generalized orthogonal partition, Latin squares and orthogonal Latin squares, we present an iterative construction method of orthogonal arrays of strength t and orthogonal partitions. As an application of the method, more orthogonal arrays of strength t and orthogonal partitions than the existing methods can be constructed.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.1 pp.308-311
- Publication Date
- 2017/01/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E100.A.308
- Type of Manuscript
- LETTER
- Category
- Coding Theory
Authors
Shanqi PANG
Henan Normal University
Ying WANG
Henan Normal University
Jiao DU
Henan Normal University
Wenju XU
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, Ying WANG, Jiao DU, Wenju XU, "Iterative Constructions of Orthogonal Arrays of Strength t and Orthogonal Partitions" in IEICE TRANSACTIONS on Fundamentals,
vol. E100-A, no. 1, pp. 308-311, January 2017, doi: 10.1587/transfun.E100.A.308.
Abstract: Orthogonal arrays and orthogonal partitions have great significance in communications and coding theory. In this letter, by using a generalized orthogonal partition, Latin squares and orthogonal Latin squares, we present an iterative construction method of orthogonal arrays of strength t and orthogonal partitions. As an application of the method, more orthogonal arrays of strength t and orthogonal partitions than the existing methods can be constructed.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.308/_p
Copy
@ARTICLE{e100-a_1_308,
author={Shanqi PANG, Ying WANG, Jiao DU, Wenju XU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Iterative Constructions of Orthogonal Arrays of Strength t and Orthogonal Partitions},
year={2017},
volume={E100-A},
number={1},
pages={308-311},
abstract={Orthogonal arrays and orthogonal partitions have great significance in communications and coding theory. In this letter, by using a generalized orthogonal partition, Latin squares and orthogonal Latin squares, we present an iterative construction method of orthogonal arrays of strength t and orthogonal partitions. As an application of the method, more orthogonal arrays of strength t and orthogonal partitions than the existing methods can be constructed.},
keywords={},
doi={10.1587/transfun.E100.A.308},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - Iterative Constructions of Orthogonal Arrays of Strength t and Orthogonal Partitions
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 308
EP - 311
AU - Shanqi PANG
AU - Ying WANG
AU - Jiao DU
AU - Wenju XU
PY - 2017
DO - 10.1587/transfun.E100.A.308
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2017
AB - Orthogonal arrays and orthogonal partitions have great significance in communications and coding theory. In this letter, by using a generalized orthogonal partition, Latin squares and orthogonal Latin squares, we present an iterative construction method of orthogonal arrays of strength t and orthogonal partitions. As an application of the method, more orthogonal arrays of strength t and orthogonal partitions than the existing methods can be constructed.
ER -
English
