两类最优带约束强部分平衡2-设计-应用数学专业论文.docxVIP

Abstract Two Classes of optimal restricted strong partially balanced 2-designs Two Classes of optimal restricted strong partially balanced 2-designs Abstract Pei, Li, Wang and Safavi-Naini formulated restricted strong partially balanced t-designs for the investigation of authentication codes with arbitration. Let v, b, μ, k, λ, t be pos- itive integers and t ≤ μ, (X, B) is a restricted partially balanced t-design, where X is a v set, B is a collection of subsets of X with size μ × k such that the following properties are satisfied: every block B ∈ B is expressed as a disjiont union of μ subblocks of size k: B = B1 ∪ B2 ∪ · · · ∪ Bμ, Bi ∩ B j = ? (i *- j, i, j ∈ {1, 2, . . . , μ}); every t subset {x1, x2, . . . , xt} of X either occurs together in exactly λ blocks, B = B1 ∪ B2 ∪ · · · ∪ Bμ, x1 ∈ Bi1 , x2 ∈ Bi2 . . . , xt ∈ Bit , or dose not occur in any block, which is denoted as RPBD t ? (v, b, μ × k; λ, 0). If a restricted partially balanced t-design RPBD t ? (v, b, μ × k; λ, 0) is a restricted partially balanced s-design for 0 s t as well, then it is called a restrict- ed strong partially balanced t-design and is denoted as RSPBD t ? (v, b, μ × k; λ, 0). Du and Liang proved that optimal splitting authentication codes that are multi-fold perfec- t against spoofing can be characterized in terms of restricted strong partially balanced t-designs, and have proved the existence of optimal restricted strong partially balanced 2- designs ORSPBD 2 ? (v, b, μ × k; 1, 0) for μ × k = 2 × 2, 2 × 3, 2 × 4and μ × k = 3 × 2, v ≡ 0 (mod 2). This paper mainly researches the existence of optimal strong partially balanced 2-designs ORSPBD 2 ? (v, b, 3 × 2; 1, 0) for v ≡ 1 (mod 2) and the existence of optimal strong partially balanced 2-designs ORSPBD 2 ? (v, b, 4 × 2; 1, 0) for v ≡ 0 (mod 4). Keywords: optimal restricted strong partial balanced t- designs, splitting authentication codes, splitting group divisible designs. Written by Zhang Jingcai Su