Optimal Sets of Binary Sequences

We suggest an efficient method for designing families of binary sequences that are optimal in the sense of packing bounds. We show that the new classes of ensembles compare favorably to the known ones in a greater variety of methods for forming the fine structure of a code and a very representable collection of existence lengths.