权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

On a Relation of the Reliability Function and the Asymptotic Distance Ratio in Shannon's Channel Coding Theorem

香农信道编码定理中可靠性函数与渐近距离比的关系

基本信息

批准号：
12650398
负责人：
NISHIJIMA Toshihisa
金额：
$ 1.54万
依托单位：
Hosei University
依托单位国家：
日本
项目类别：
Grant-in-Aid for Scientific Research (C)
财政年份：
2000
资助国家：
日本
起止时间：
2000 至 2002
项目状态：
已结题

来源：
https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-12650398/
关键词：
Probability of Undetected Error Average Probability of Undetected Error Varshamov-Gilbert Bound Expurgated Bound Concatenated Codes Iterated Codes Generalized Reed-Solomon Codes Binary Weight Distribution 繰り返し符号

项目摘要

There are three main points of our research results as follows.1. We get an upper bound on the average probability of undetected error for the ensemble of binary expansions of generalized Reed-Solomon codes. From this bound, we simultaneously show that the asymptotic distance ration for the ensemble of these codes meets the Varshamov-Gilbert bound and this ensemble satisfies the expurgated bound.2. Iterated codes given by P. Elias are well known as a class of the codes satisfying the channel-coding theorem. By utilizing the way for deriving an upper bound on the average probability of undetected error for the ensemble of all binary systematic linear block codes, we can easily get that for the ensemble of all iterated codes. It is shown that the average capability for the ensemble of all iterated codes is poorer than that for all binary systematic linear block codes.3. Concatenated codes given by G. D. Forney, Jr. are very important codes from practical and theoretical viewpoint. By utilizing a characteristic structure of the concatenated code, an approximately good computation method of the probability of undetected error without knowing binary weight distribution of the concatenated code is proposed. Since the computational complexity of the method is at the most O(n) where n is a code length of a outer code of the concatenated code, it is an efficient method when investigating the capability of error detection for the concatenated code from practical and theoretical viewpoint. By comparing exact values with approximate values in some examples of the codes, which are small enough for the weight distribution to be found by computer search, we show the efficiency of the approximate values by the proposed method.

本文的研究成果主要有以下三点：1.我们得到了广义Reed-Solomon码的二元展开系综的平均不可检错误概率的一个上界。从这个界出发，我们同时证明了这些码的系综的渐近距离比满足Varshamov-Gilbert界，并且这个系综满足删除界. Elias给出的迭代码是一类满足信道编码定理的码。利用推导所有二元系统线性分组码系综的平均不可检错误概率上界的方法，我们可以很容易地得到所有迭代码系综的平均不可检错误概率上界。结果表明，所有迭代码的总体性能比所有二元系统线性分组码的总体性能差. G. D.小福尼从实践和理论的角度来看，都是非常重要的代码。利用级联码的特征结构，提出了一种在不知道级联码的二进制重量分布的情况下，近似良好的不可检测错误概率的计算方法。由于该方法的计算复杂度最多为O（n），其中n是级联码的外码的码长，因此从实践和理论的角度来看，在研究级联码的错误检测能力时，它是一种有效的方法。通过比较精确值与近似值在一些例子的代码，这是足够小的重量分布被发现由计算机搜索，我们显示了所提出的方法的近似值的效率。