We define extended orthogonal sets of d-cubes and show that they are equivalent to a class of orthogonal arrays, to geometric nets and a class of codes. As a corollary, an upper bound for the maximal number of d-cubes in an orthogonal set is obtained.
