二元Hamming结合方案的紧相对6-设计

展开
  • 1. Mathematics and Information College, Langfang Teachers University2. Mathematics and Information College, Hebei Normal University3. Institute of Applied Mathematics, Shijiazhuang Mechanical Engineering College
LI Zeng-ti(1964-), male, native of Cangxian, Hebei, a professor of Langfang Teachers University, Ph.D., engages in algebra and combinatorics.

收稿日期: 2013-10-30

  网络出版日期: 2020-11-20

基金资助

Supported by the Natural Science Foundation of Hebei Province(A2013408009); Supported by the Specialized Research Fund for the Doctoral Program of Higher Education(20121303110005); Supported by the Natural Science Foundation of Hebei Education Department(ZH2012082); Supported by the Foundation of Langfang Teachers University(LSBS201205);

Tight Relative 6-designs on Binary Hamming Association Schemes

Expand
  • 1. Mathematics and Information College, Langfang Teachers University2. Mathematics and Information College, Hebei Normal University3. Institute of Applied Mathematics, Shijiazhuang Mechanical Engineering College
LI Zeng-ti(1964-), male, native of Cangxian, Hebei, a professor of Langfang Teachers University, Ph.D., engages in algebra and combinatorics.

Received date: 2013-10-30

  Online published: 2020-11-20

Supported by

Supported by the Natural Science Foundation of Hebei Province(A2013408009); Supported by the Specialized Research Fund for the Doctoral Program of Higher Education(20121303110005); Supported by the Natural Science Foundation of Hebei Education Department(ZH2012082); Supported by the Foundation of Langfang Teachers University(LSBS201205);

摘要

The concept of relative t-designs for Q-polynomial association schemes is due to Delsarte(Philips Res Rep 32: 373C411, 1997). In this paper, we discuss the Fisher type lower bounds of tight relative 6-designs very explicitly for binary Hamming association schemes H(n, 2).

本文引用格式

李增提, 高锁刚, 冯光辉 . 二元Hamming结合方案的紧相对6-设计[J]. 数学季刊, 2015 , 30(3) : 389 -407 . DOI: 10.13371/j.cnki.chin.q.j.m.2015.03.010

Abstract

The concept of relative t-designs for Q-polynomial association schemes is due to Delsarte(Philips Res Rep 32: 373C411, 1997). In this paper, we discuss the Fisher type lower bounds of tight relative 6-designs very explicitly for binary Hamming association schemes H(n, 2).
文章导航

/