LAUSR

The concept of splitting-balanced block designs (SBD) was defined with some applications for authentication codes by Ogata, Kurosawa, Stinson and Saido. The existence of SBDs has been discussed through direct and recursive constructions in literature. In this paper, we focus on the property of resolvability in a SBD, and two improved bounds for the number of blocks in SBDs with resolvability are presented. Furthermore, some equivalence between SBDs with resolvability and other combinatorial designs are provided. Finally existence results of some classes of SBDs with resolvability are shown by use of recursive constructions and available results on other combinatorial structures.