摘要
本文给出了二元n维随机置换的钟控概率模型 ,讨论了它的基本性质 ,得到了二元n维随机置换输入输出互信息的简单计算公式 ,给出了它的下界。同时也得到了二元n维随机置换输入输出与随机置换互信息的简单计算公式。从而得到了在已知输出的条件之下 ,理论上平均求输入的计算复杂度 ,以及在已知输入输出的条件之下 ,理论上平均求随机置换的计算复杂度。
This paper centers around the mutual information between input and output sequences of the binary n dimension and obtains the simple formula to calculate the mutual information between them.The lower bound is defined and the simple formula to calculate the mutual information between I/O and random permutation is acquired.The meaning of the mutual information between them is discussed.
出处
《信息工程大学学报》
2000年第2期12-15,共4页
Journal of Information Engineering University
关键词
二元n维随机置换
互信息
计算复杂度
mutual infomation of the binary n dimension random permutation
random permutation
computational complexity