Spectrum of splitting 3-designs with block size 3 x 2

被引：0

作者：

Wang, Jian ^{[1
]}

Cheng, Xiaojun ^{[2
]}

Du, Beiliang ^{[2
]}

机构：

[1] Natong Vocat Coll, Natong 226007, Peoples R China

[2] Suzhou Univ, Soochow Univ, Dept Math, Suzhou 215006, Peoples R China

来源：

UTILITAS MATHEMATICA | 2016年 / 100卷

基金：

中国国家自然科学基金;

关键词：

splitting; 3-designs; splitting authentication codes; candelabra splitting 3-systems; AUTHENTICATION CODES; DESIGNS;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Splitting t-designs were first formulated by Huber in recent investigation of optimal (t-1)-fold secure splitting authentication codes. In paper [M. Liang and B.Du, A new class of splitting 3-designs. Des. Codes Cryptogr., 60 (2011), 283-290], it has been given that the necessary and sufficient condition for the existence of 3-(v, 3 x 2,1) splitting designs. In this paper, it will be completely determined that the spectrum problem of 3-(v, 3 x 2, lambda) splitting designs, is that (1) lambda v(v - 1)(v - 2) equivalent to 0 (mod 48), (2) lambda(v - 1)(v - 2) equivalent to 0 (mod 8), (3) lambda(v - 2) equivalent to 0 (mod 2) and (4) v >= 6.

引用

页码：237 / 252

页数：16

共 13 条

[1] INFINITE FAMILIES OF OPTIMAL SPLITTING AUTHENTICATION CODES SECURE AGAINST SPOOFING ATTACKS OF HIGHER ORDER [J].