Tight Relative 6-designs on Binary Hamming Association Schemes  

作　　者：李增提 高锁刚 冯光辉 

机构地区：[1]Mathematics and Information College, Langfang Teachers University [2]Mathematics and Information College, Hebei Normal University [3]Institute of Applied Mathematics, Shijiazhuang Mechanical Engineering College

出　　处：《Chinese Quarterly Journal of Mathematics》2015年第3期389-407,共19页数学季刊（英文版）

基　　金：Supported by the Natural Science Foundation of Hebei Province（A2013408009）; Sup- ported 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).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）.

关 键 词：ASSOCIATION SCHEME RELATIVE T-DESIGN Hamming ASSOCIATION SCHEME 

分 类 号：O157[理学—数学]