Harmonic Index Designs in Binary Hamming Schemes.

We recall the 'addition formula' for a commutative association scheme. From this formula we construct a linear programming for the size of harmonic index designs and define the notion of tight designs using Fisher type inequality. We examine the existence of tight harmonic index T-designs for some T in binary Hamming association schemes H( d, 2). [ABSTRACT FROM AUTHOR]