| 强分裂系统码 |
| |
| 引用本文： | 杨建生,冯显敏.强分裂系统码[J].上海大学学报(自然科学版),2009,15(3):265-271. |
| |
| 作者姓名： | 杨建生 冯显敏 |
| |
| 作者单位： | 上海大学 理学院,上海 200444 |
| |
| 摘 要： | 从分裂认证码出发,构造一种新的强系统认证码.利用这种特殊的码与一般系统认证码的关系,得到这种码的最大模仿概率PSI的下界公式;另外,进一步探讨ci(i=1,2,…,k)固定的(c1,c2,…,ck)型强分裂系统码的PSI的下界公式,并且给出把已知的(c1,c2,…,ck)型强分裂系统码转变到PSI最小的(c1,c2,…,ck)型强分裂系统码方法.
|
| 关 键 词： | 强分裂系统码 局部平衡化 相互平衡化 |
| 收稿时间： | 2008-01-24 |
Strongly Splitting Systematic Authentication Codes |
| |
| YANG Jian-sheng,FENG Xian-min.Strongly Splitting Systematic Authentication Codes[J].Journal of Shanghai University(Natural Science),2009,15(3):265-271. |
| |
| Authors: | YANG Jian-sheng FENG Xian-min |
| |
| Institution: | College of Sciences, Shanghai University, Shanghai 200444, China |
| |
| Abstract: | From the splitting systematic authentication codes, a new kind of codes that is strongly splitting systematic authentication codes is constructed. By studying relation between this special codes and general systematic authentication codes, a low bound of maximum probabilities of a successful impersonation PS*I for all those codes is derived if encoding rule distributions are equiprobable. Moreover, we seek the low bound PS*I of (c1,c2,…,ck) style strongly splitting systematic authentication codes ci(i=1,2,…,k), and turn a given (c1,c2,…,ck) style strongly splitting systematic authentication codes into the same style of codes having minimal PS*I. |
| |
| Keywords: | strongly splitting systematic authentication codes local uniformization mutual uniformization |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《上海大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《上海大学学报(自然科学版)》下载免费的PDF全文 |
|
