Direct constructions of column-orthogonal strong orthogonal arrays

IF 0.9 2区 数学 Q2 MATHEMATICS Journal of Combinatorial Theory Series A Pub Date : 2024-10-18 DOI:10.1016/j.jcta.2024.105965
Jingjun Bao , Lijun Ji , Juanjuan Xu
{"title":"Direct constructions of column-orthogonal strong orthogonal arrays","authors":"Jingjun Bao ,&nbsp;Lijun Ji ,&nbsp;Juanjuan Xu","doi":"10.1016/j.jcta.2024.105965","DOIUrl":null,"url":null,"abstract":"<div><div>Strong orthogonal arrays have better space-filling properties than ordinary orthogonal arrays for computer experiments. Strong orthogonal arrays of strengths two plus, two star and three minus can improve the space-filling properties in low dimensions and column orthogonality plays a vital role in computer experiments. In this paper, we use difference matrices and generator matrices of linear codes to present several constructions of column-orthogonal strong orthogonal arrays of strengths two plus, two star, three minus and <em>t</em>. Our constructions can provide larger numbers of factors of column-orthogonal strong orthogonal arrays of strengths two plus, two star, three minus and <em>t</em> than those in the existing literature, enjoy flexible run sizes. These constructions are convenient, and the resulting designs are good choices for computer experiments.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"209 ","pages":"Article 105965"},"PeriodicalIF":0.9000,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series A","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0097316524001043","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Strong orthogonal arrays have better space-filling properties than ordinary orthogonal arrays for computer experiments. Strong orthogonal arrays of strengths two plus, two star and three minus can improve the space-filling properties in low dimensions and column orthogonality plays a vital role in computer experiments. In this paper, we use difference matrices and generator matrices of linear codes to present several constructions of column-orthogonal strong orthogonal arrays of strengths two plus, two star, three minus and t. Our constructions can provide larger numbers of factors of column-orthogonal strong orthogonal arrays of strengths two plus, two star, three minus and t than those in the existing literature, enjoy flexible run sizes. These constructions are convenient, and the resulting designs are good choices for computer experiments.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
列正交强正交阵列的直接构造
在计算机实验中,强正交阵列比普通正交阵列具有更好的空间填充特性。强度为两加、两星和三减的强正交阵列可以改善低维的空间填充特性,而列正交性在计算机实验中起着至关重要的作用。在本文中,我们利用线性编码的差分矩阵和生成矩阵,提出了几种列正交强正交阵列的构造。我们的构造可以提供比现有文献中更多的列正交强正交阵列因子数,并享有灵活的运行规模。这些构造非常方便,由此产生的设计是计算机实验的良好选择。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.90
自引率
9.10%
发文量
94
审稿时长
12 months
期刊介绍: The Journal of Combinatorial Theory publishes original mathematical research concerned with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series A is concerned primarily with structures, designs, and applications of combinatorics and is a valuable tool for mathematicians and computer scientists.
期刊最新文献
Dominance complexes, neighborhood complexes and combinatorial Alexander duals Upper bounds for the number of substructures in finite geometries from the container method The vector space generated by permutations of a trade or a design Editorial Board Some conjectures of Ballantine and Merca on truncated sums and the minimal excludant in congruences classes
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1