强分裂系统码

上海大学学报(自然科学版) ›› 2009, Vol. 15 ›› Issue (3): 265-271.

强分裂系统码

杨建生冯显敏

上海大学理学院,上海 200444

收稿日期:2008-01-24 出版日期:2009-06-30 发布日期:2009-06-30
通讯作者: 杨建生（1963～），男，副教授，博士，研究方向为图论、编码理论. E-mail:yjsyjs@staff.shu.edu.cn

Strongly Splitting Systematic Authentication Codes

YANG Jian-Sheng, FENG Xian-Min

College of Sciences, Shanghai University, Shanghai 200444, China

Received:2008-01-24 Online:2009-06-30 Published:2009-06-30

摘要/Abstract

摘要：

从分裂认证码出发,构造一种新的强系统认证码.利用这种特殊的码与一般系统认证码的关系,得到这种码的最大模仿概率PSI的下界公式;另外,进一步探讨ci(i=1,2,…,k)固定的(c1,c2,…,ck)型强分裂系统码的PSI的下界公式,并且给出把已知的(c1,c2,…,ck)型强分裂系统码转变到PSI最小的(c1,c2,…,ck)型强分裂系统码方法.

关键词: 强分裂系统码;局部平衡化;相互平衡化

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 PS*I for all those codes is derived if encoding rule distributions are equiprobable. Moreover, we seek the low bound PS*I of (c1,c2,…,ck) style strongly splitting systematic authentication codes ci(i=1,2,…,k), and turn a given (c1,c2,…,ck) style strongly splitting systematic authentication codes into the same style of codes having minimal PS*I. 

Key words: strongly splitting systematic authentication codes; local uniformization; mutual uniformization

中图分类号:

O157.4

杨建生冯显敏. 强分裂系统码[J]. 上海大学学报(自然科学版), 2009, 15(3): 265-271.

YANG Jian-Sheng, FENG Xian-Min. Strongly Splitting Systematic Authentication Codes[J]. Journal of Shanghai University（Natural Science Edition）, 2009, 15(3): 265-271.