摘要
带反馈对称信道的最优e-纠错编码等价于Ulam-Rényi容错搜索问题中的最小提问次数q(n;e).情形e∈{1,2,3}时确定q(n;e)的精确值问题己经解决.本文将针对e=2所建立的著名的Guzicki算法推广到一般情形.我们的主要结果提供了用来判定搜索过程中出现的任意状态是否能够达到其信息论下界的一个精确的算法.
Optimal e-error-correcting codes for symmetric channels with feedback is equivalent to the minimum number q(n;e) of questions of the Ulam-Rényi problem. The problem of determining the exact values of q(n;e) have been solved for the cases e∈｛1,2,3｝ and all n1. The well-known Guzichi′s algorithm is generalized to arbitrary e. Our main results provide an accurate algorithm which can be used to judge whether the information-theoretic bound is achieved for any possible state.
出处
《河南师范大学学报（自然科学版）》
CAS
CSCD
2004年第1期1-6,共6页
Journal of Henan Normal University(Natural Science Edition)
基金
国家自然科学基金资助项目(69874010)
