Abstract
The concept of relative t-designs for Q-polynomial association schemes is due to Delsarte (Philips Res Rep 32:373–411, 1997). We formulate Fisher type lower bounds as well as the concept of tight relative 2- and 4-designs very explicitly for binary Hamming association schemes H(n, 2). Then we discuss some examples of tight relative 2- and 4-designs on H(n, 2) in this sense, in connection with the work of Woodall (Proc Lond Math Soc (3) 20:669–687, 1970), Enomoto-Ito-Noda (Osaka J Math 16:39–43, 1979), and others. The present paper is expected to be the first of a series of our studies of tight relative t-designs on Q-polynomial association schemes in a more general context.
Similar content being viewed by others
References
Bannai, E., Bannai, E.: Remarks on the concepts of t-designs. J. Appl. Math. Comput. (2012). doi:10.1007/s12190-012-0544-1 (Proceedings of AGC2010.)
Bannai, E., Ito, T.: Algebraic Combinatorics I: Association Schemes, Benjamin/Cummings, Menlo Park, Calfornia (1984)
Delsarte, P.: An algebraic approach to the association schemes of the coding theory. Thesis, Universite Catholique de Louvain (1973); Philips Res. Rep. Suppl. 10 (1973)
Delsarte P.: Pairs of vectors in the space of an association scheme. Philips Res. Rep. 32, 373–411 (1977)
Delsarte P., Seidel J.J.: Fisher type inequalities for Euclidean t-designs. Linear Algebra Appl. 114(115), 213–230 (1989)
Enomoto H., Ito N., Noda R.: Tight 4-designs. Osaka J. Math. 16, 39–43 (1979)
Möller, H.M.: Lower bounds for the number of nodes in cubature formulae. Numerische Integration (Tagung, Math. Forschungsinst., Oberwolfach, 1978), 221–230; International Series of Numerical Mathematics, vol. 45, Birkhäuser, Basel (1979)
Neumaier A., Seidel J.J.: Discrete measures for spherical designs, eutactic stars and lattices. Nederl. Akad. Wetensch. Proc. Ser. A 91 = Indag. Math. 50, 321–334 (1988)
Noda R.: On orthogonal arrays of strength 4 achieving Rao’s bound. J. Lond. Math. Soc. (2) 19(3), 385–390 (1979)
Woodall D.R.: Square λ-linked designs. Proc. Lond. Math. Soc. 20(3), 669–687 (1970)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, Z., Bannai, E. & Bannai, E. Tight Relative 2- and 4-Designs on Binary Hamming Association Schemes. Graphs and Combinatorics 30, 203–227 (2014). https://doi.org/10.1007/s00373-012-1252-1
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-012-1252-1