The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
직교 배열 이론에서 직교 배열(OA)의 행이 해밍 거리와 관련하여 연관 체계를 형성하는 경우 이를 도식이라고 합니다. 본 논문에서는 OA의 두 행에 대한 해밍 거리를 연구하고, 강도 XNUMX의 일부 도식 OA를 구성하고, 모든 도식 OA를 분류하기 위한 공개 문제에 대한 긍정적인 솔루션을 제공합니다. 우리의 방법을 설명하기 위해 몇 가지 예가 제공됩니다.
Shanqi PANG
Henan Normal University
Yongmei LI
Henan Normal University
Rong YAN
Henan Normal University
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.
부
Shanqi PANG, Yongmei LI, Rong YAN, "Schematic Orthogonal Arrays of Strength Two" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 2, pp. 556-562, February 2020, doi: 10.1587/transfun.2019EAL2088.
Abstract: In the theory of orthogonal arrays, an orthogonal array (OA) is called schematic if its rows form an association scheme with respect to Hamming distances. In this paper, we study the Hamming distances of any two rows in an OA, construct some schematic OAs of strength two and give the positive solution to the open problem for classifying all schematic OAs. Some examples are given to illustrate our methods.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2019EAL2088/_p
부
@ARTICLE{e103-a_2_556,
author={Shanqi PANG, Yongmei LI, Rong YAN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Schematic Orthogonal Arrays of Strength Two},
year={2020},
volume={E103-A},
number={2},
pages={556-562},
abstract={In the theory of orthogonal arrays, an orthogonal array (OA) is called schematic if its rows form an association scheme with respect to Hamming distances. In this paper, we study the Hamming distances of any two rows in an OA, construct some schematic OAs of strength two and give the positive solution to the open problem for classifying all schematic OAs. Some examples are given to illustrate our methods.},
keywords={},
doi={10.1587/transfun.2019EAL2088},
ISSN={1745-1337},
month={February},}
부
TY - JOUR
TI - Schematic Orthogonal Arrays of Strength Two
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 556
EP - 562
AU - Shanqi PANG
AU - Yongmei LI
AU - Rong YAN
PY - 2020
DO - 10.1587/transfun.2019EAL2088
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2020
AB - In the theory of orthogonal arrays, an orthogonal array (OA) is called schematic if its rows form an association scheme with respect to Hamming distances. In this paper, we study the Hamming distances of any two rows in an OA, construct some schematic OAs of strength two and give the positive solution to the open problem for classifying all schematic OAs. Some examples are given to illustrate our methods.
ER -