Fast operations for certain two alphabet circulant matrices

In order to efficiently compute some combinatorial designs based upon circulant matrices which have different, defined numbers of 1's and 0's in each row and column we need to find candidate vectors with differing weights and Hamming distances. This paper concentrates on how to efficiently create such circulant matrices. These circulant matrices have applications in signal processing, public key codes and spectography