z-logo
Premium
Splitting balanced incomplete block designs with block size 3 × 2
Author(s) -
Du Beiliang
Publication year - 2004
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.20025
Subject(s) - mathematics , block (permutation group theory) , combinatorics , block design , spectrum (functional analysis) , block size , discrete mathematics , computer science , physics , computer security , key (lock) , quantum mechanics
Splitting balanced incomplete block designs were first formulated by Ogata, Kurosawa, Stinson, and Saido recently in the investigation of authentication codes. This article investigates the existence of splitting balanced incomplete block designs, i.e., ( v , 3 k , λ)‐splitting BIBDs; we give the spectrum of ( v , 3 × 2, λ)‐splitting BIBDs. As an application, we obtain an infinite class of 2‐splitting A ‐codes. © 2004 Wiley Periodicals, Inc.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here