New classes of self-complementary codes and quasi-symmetric designs

We present a new technique for constructing binary error correcting codes and give some examples of codes that can be constructed via this method. Among the examples is an infinite family of self-complementary codes with parameters (2u ²−u, 8u ², u ²−u) that can be constructed whenever there exists a u × u Hadamard Matrix. These codes meet the Grey–Rankin bound and imply the existence of quasi-symmetric designs on 2u ²−u points.