Optimal weighing designs with a string property

We consider the usual (spring balance) weighing design set-up with the design matrix having a string property meaning thereby that in every row of it, there is exactly one run of 1's (the rest of the elements being 0's). We have investigated some interesting features of such matrices and used them in deriving various optimality results.