中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Latin Matchings and Ordered Designs OD(n-1, n, 2n-1)

文献类型:期刊论文

作者Jin, Kai3; Zhu, Taikun3; Gu, Zhaoquan2; Sun, Xiaoming1
刊名MATHEMATICS
出版日期2022-12-01
卷号10期号:24页码:18
关键词combinatorial design ordered design Hamming code error-correcting code hat guessing game Latin matching antipodal matching Latin square and hypercube multiagent system
DOI10.3390/math10244703
英文摘要This paper revisits a combinatorial structure called the large set of ordered design (LOD). Among others, we introduce a novel structure called Latin matching and prove that a Latin matching of order n leads to an LOD(n-1, n, 2n-1); thus, we obtain constructions for LOD(1, 2, 3), LOD(2, 3, 5), and LOD(4, 5, 9). Moreover, we show that constructing a Latin matching of order n is at least as hard as constructing a Steiner system S(n-2, n-1, 2n-2); therefore, the order of a Latin matching must be prime. We also show some applications in multiagent systems.
资助项目National Natural Science Foundation of China ; Shenzhen Science and Technology Program[62002394] ; [202206193000001] ; [20220817175048002]
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000904397500001
出版者MDPI
源URL[http://119.78.100.204/handle/2XEOYT63/20118]  
专题中国科学院计算技术研究所期刊论文
通讯作者Jin, Kai
作者单位1.Chinese Acad Sci, Inst Comp technol, Beijing 100864, Peoples R China
2.Harbin Inst Technol Shenzhen, Sch Comp Sci & Technol, Shenzhen 518055, Peoples R China
3.Sun Yat Sen Univ, Sch Intelligent Syst Engn, Shenzhen Campus, Shenzhen 518107, Peoples R China
推荐引用方式
GB/T 7714
Jin, Kai,Zhu, Taikun,Gu, Zhaoquan,et al. Latin Matchings and Ordered Designs OD(n-1, n, 2n-1)[J]. MATHEMATICS,2022,10(24):18.
APA Jin, Kai,Zhu, Taikun,Gu, Zhaoquan,&Sun, Xiaoming.(2022).Latin Matchings and Ordered Designs OD(n-1, n, 2n-1).MATHEMATICS,10(24),18.
MLA Jin, Kai,et al."Latin Matchings and Ordered Designs OD(n-1, n, 2n-1)".MATHEMATICS 10.24(2022):18.

入库方式: OAI收割

来源:计算技术研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。