Almost designs and their links with balanced incomplete block designs

Michel, Jerod; Wang, Qi

2019-09

10.1007/s10623-018-00596-4

DESIGNS CODES AND CRYPTOGRAPHY   影响因子和分区

0925-1022

1573-7586

Almost designs (t-adesigns) were proposed and discussed by Ding as a certain generalization of combinatorial designs related to almost difference sets. Unlike t-designs, it is not clear whether t-adesigns need also be (t - 1)-designs or (t - 1)-adesigns. In this paper we discuss a particular class of 3-adesigns, i.e., 3-adesigns coming from certain strongly regular graphs and tournaments, and find that these are also 2-designs. We construct several classes of these, and discuss some of the restrictions on the parameters of such a class. We also construct several new classes of 2-adesigns, and discuss some of their properties as well.

Almost difference set Difference set Strongly regular graph t-adesign Tournament

SCI ; EI

英语

第一 ; 通讯

National Science Foundation of China[11601220]

Computer Science ; Mathematics

Computer Science, Theory & Methods ; Mathematics, Applied

WOS:000483581300001

SPRINGER

20190206354954

Computer applications ; Mathematical techniques

Computer Applications:723.5 ; Combinatorial Mathematics, Includes Graph Theory, Set Theory:921.4

COMPUTER SCIENCE

Web of Science

Southern Univ Sci & Technol, Dept Comp Sci & Engn, Shenzhen 518055, Peoples R China

Michel, Jerod,Wang, Qi. Almost designs and their links with balanced incomplete block designs[J]. DESIGNS CODES AND CRYPTOGRAPHY,2019,87(9):1945-1960.

Michel, Jerod,&Wang, Qi.(2019).Almost designs and their links with balanced incomplete block designs.DESIGNS CODES AND CRYPTOGRAPHY,87(9),1945-1960.

Michel, Jerod,et al."Almost designs and their links with balanced incomplete block designs".DESIGNS CODES AND CRYPTOGRAPHY 87.9(2019):1945-1960.