Finding defining generators with extreme lengths

In some practical situations the choice of defining generators matters even for the same defining contrast subgroup. Two such examples are blocking schemes for full and fractional factorial designs and split-plot fractional factorial designs. We propose an algorithm to find defining generators with extreme lengths for any s^n-k designs, s being a prime power. Some illustrations of the method are given.