摘要
在文献［１］的基础上，分析了作者提出的两个方案，对ｐＩ，ｐＳ的下界结果给出了更为简洁的证明．
On the basis of the paper, we analyse the two schemes presented in. Then, a novel method of proof on p I and p s is given. The main part is that we resolved the problem remained in paper: How to systematically partition the set of encoding rules?
出处
《北京邮电大学学报》
EI
CAS
CSCD
1996年第3期53-58,共6页
Journal of Beijing University of Posts and Telecommunications
基金
国家自然科学基金
关键词
保密通信
纠错码
认证码
阈下信道
secret communication
error correcting code
authentication code
subliminal channel
