Ulam-Rényi problem on searching with errors and optimal error-correcting codes
Liu Wen-an, Nie Zan-kan · Journal of Henan Normal University · 2004
Optimal e-error-correcting codes for symmetric channels with feedback is equivalent to the minimum number q(n;e) of questions of the Ulam-Renyi 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.