| 完全杂凑族的一个新下界 |
| |
| 引用本文： | 龙寿伦,程永宽.完全杂凑族的一个新下界[J].中国科学技术大学学报,2007,37(3):251-254. |
| |
| 作者姓名： | 龙寿伦 程永宽 |
| |
| 作者单位： | 中国科学技术大学数学系,安徽合肥,230026 |
| |
| 摘 要： | 考虑(n,m,w)-完全杂凑族的下界,运用初等的方法给出一个新的下界,并给出新的下界比著名的Fredman-Komlos下界好的条件.
|
| 关 键 词： | 完全杂凑族 组合设计 密码学 纠错码 |
| 文章编号： | 0253-2778(2007)03-0251-04 |
| 修稿时间： | 12 20 2005 12:00AM |
A new lower bound on perfect hash families |
| |
| LONG Shou-lun,CHENG Yong-kuan.A new lower bound on perfect hash families[J].Journal of University of Science and Technology of China,2007,37(3):251-254. |
| |
| Authors: | LONG Shou-lun CHENG Yong-kuan |
| |
| Institution: | Department of Mathematics, University of Science and Technology of China, He f ei 230026, China |
| |
| Abstract: | The lower bound of(n,m,w)-perfect hash families was considered,and a new lower bound was derived by elementary method directly.The conditions under which the new bound is better than the well-known result of Fredman and Komlos were also given. |
| |
| Keywords: | perfect hash families combinatorial designs cryptography error-correcting codes |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
