带反馈非对称信道的最优纠错编码  

Optimal Error-correcting Codes for Asymmetric Channels with Feedback

作　　者：刘文安[1] 张启敏[1] 聂赞坎[1] 

机构地区：[1]西安交通大学理学院

出　　处：《应用数学》2004年第1期144-149,共6页Mathematica Applicata

基　　金：国家自然科学基金资助项目 (6 9874 0 1 0 )

摘　　要：带反馈非对称信道的最优纠错编码等同于Ulam Renyi问题的半谎搜索模型的最少提问次数qhl(m) .本文证明了qhl(m)的取值分布具有非交叉性 .借助于这一良好的分布特性 ,原始的确定最少提问次数精确值问题可以被简化为确定一个临界数问题并且这个临界数的存在性和唯一性得到了证明 .同时本文也改进了Cicalese等人的结果 ,在更大的范围内明确地给出了最少提问次数qhl(m)Optimal errorcorrecting codes for asymmetric channels with feedback are the same as minimum number q hl (m) of questions in searching with half lies,a variant of UlamRenyi problem.It is proved that the distribution of q hl (m) is of noncross property.The original problem of determining the exact value of q hl (m) can be simplified to determine a critical number by virtue of this better property and the existence and uniqueness of this critical number are also proved.Furthemore,the exact values of q hl (m) are explicitly given for more integers m,thus strengthening previous results given by Cicalese et al.

关 键 词：反馈非对称信道 最优纠错编码 非交叉性 临界数 容错搜索 全谎搜索 半谎搜索 

分 类 号：O229[理学—运筹学与控制论]