More Thwarts in Transversal Designs

More Thwarts in Transversal Designs

A transversal design of order n and block size k, or TD(k; n), is a triple (X, G, B ), where X is a set of kn elements. G 5 hG1 , . . . , Gkj is a partition of X into k sets each of size n; each class of the partition is a group. B is a set of k-subsets of X, with the property that each B [ B satisfies uB > Giu 5 1 for each 1 # i # k; sets in B are blocks. Finally, each unordered pair of elemen...

Transversal Designs in Classical Planes and Spaces

Possible embeddings of transversal designs in the classical projective spaces on nite elds are characterized.

On simple and supersimple transversal designs

In this paper, the existence of a transversal design T D (4; g) is proved for all indices satisfying 2 g such that any two of its blocks intersect in at most two elements.

Symmetric Transversal Designs with Group Size 3

Private Information Retrieval from Transversal Designs

Private information retrieval (PIR) protocols allow a user to retrieve entries of a database without revealing the index of the desired item. Information-theoretical privacy can be achieved by the use of several servers and specific retrieval algorithms. Most of known PIR protocols focus on decreasing the number of bits exchanged between the client and the server(s) during the retrieval process...