OBIBD construction for Netto designs
Let v be a prime number or power of the form 12t+7, and x be a primitive root of the Galois Field of order v. If there exists an integer m such that (xm-1),(x4t+m+2-1) and (x8t+m+4-1) are all odd, or all even, powers of x, then an OBIBD(v) can be constructed from the initial blocks:
(x2i,x2i+m; x4t+2i+2,x4t+2i+ m+2;x8t+2i+4,x 8t+2i+m+4), for i = 0,1,...,2t
(The full design is obtained by developing the initial blocks over the elements of the Galois Field.)

Proof.The difference square formed by the typical block is:

  x2i+m x4t+2i+m+2 x8t+2i+m+4
x2i x2i+a x2i+b x2i+c
x4t+2i+2 x4t+2i+2+c x4t+2i+2+a x4t+2i+2+b
x8t+2i+4 x8t+2i+4+b x8t+2i+4+c x8t+2i+4+a

where xa=(xm-1), xb=(x4t+m+2-1), and xc=(x8t+m+4-1).

If all of these are odd(even), then all the differences in the typical square will be odd(even), and the complete set of all differences generated will comprise 3 occurrences of each of the odd(even) powers of x. The elements on the leading diagonals will comprise one occurrence of each (being multiples of a fixed element by all the even powers of the primitive root).

The design generated for the second set of treatments is a BIBD. The differences generated in the initial blocks will be exactly the same as those for the first set of treatments, save that they are multiplied by xm throughout.

The elements on the leading diagonals, comprising all the odd(even) powers, generate a Symmetric BIBD.

The theorem appears to be true for exactly t values of m in the range 0 < m < (4t+2): a table of values of m is given here. Alternatively, an applet will do the work here, while another applet here will get the initial blocks, given a suitable value of m.

Suppose m and n are two suitable values; if these two sets of treatments are to be orthogonal (i.e. forming a design with 3 sets of treatments), then the difference square with the typical blocks based on these values used in the margins, leads to the conclusion that m-n must also be in the set of suitable values.

When v = 19, t is 1, and a primitive root is 2. m is found to be 3: x3-1=7=x6,x9-1=17= x10 and x15-1=11=x12. A suitable set of initial blocks is

(1,8; 7,18; 11,12), (4,17; 9,15; 6,10), (16,14; 17,3; 5,2)

to be developed mod 19.