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 exp...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).展开更多
Ad Hoc网络现在是非常有吸引力的研究方向,它是一种优秀的移动无线自组织网络,与传统有线网络和一般无线网络存在着很大区别,因而使得传统的基于可信任第三方的CA认证方案不再适用,而基于门限加密的分布方案有其固有的假设条件,在具体...Ad Hoc网络现在是非常有吸引力的研究方向,它是一种优秀的移动无线自组织网络,与传统有线网络和一般无线网络存在着很大区别,因而使得传统的基于可信任第三方的CA认证方案不再适用,而基于门限加密的分布方案有其固有的假设条件,在具体实施时也有很大的困难。有别于以上方案,利用了无证书签名的思想,对无认证中心的基于自认证的门限签名方案在移动Ad Hoc网络环境中的应用进行了研究,并给出了它的实现方案。展开更多
基金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）+1 种基金 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).
