Harmonic Index t-Designs in the Hamming Scheme for Arbitrary q

The notion of T -design in a symmetric association scheme was introduced by Delsarte. A harmonic index t -design is the particular case in which the index set T consists of a single index { t } . Zhu et al. studied a harmonic index t -design in the binary Hamming scheme and gave a Fisher type lower bound on the cardinality. Also they defined the notion of a tight harmonic index design using the bound, and considered the classification problem. In this paper, we extend their results to the general Hamming scheme and improve their Fisher type lower bound slightly. Also using the improved Fisher type lower bound, we redefine the notion of a tight harmonic index design and consider the classification problem. Furthermore, we give a natural characterization for a harmonic index t -design and an analogue in the Hamming scheme for the construction of spherical harmonic index t -designs which was given by Bannai–Okuda–Tagami.