On a Relation of the Reliability Function and the Asymptotic Distance Ratio in Shannon's Channel Coding Theorem
On a Relation of the Reliability Function and the Asymptotic Distance Ratio in Shannon's Channel Coding Theorem
批准号:
12650398
负责人:
NISHIJIMA Toshihisa
金额:
$1.54万
依托单位:
依托单位国家:
日本
项目类别:
Grant-in-Aid for Scientific Research (C)
财政年份:
2000
资助国家:
日本
项目状态:
已结题
起止时间:
2000 至 2002
中文摘要
我们的研究成果主要有以下三点。本文给出了广义Reed-Solomon码的二进制展开式集合的不可检测误差平均概率的上界。从这个界出发,我们同时证明了这些码的集合的渐近距离比满足Varshamov-Gilbert界,并且这个集合满足消去界。Elias给出的迭代码是一类满足信道编码定理的码。利用求出所有二进制系统线性分组码集合的平均未检出错误概率的上界的方法,可以很容易地求出所有迭代码集合的平均未检出错误概率的上界。结果表明,所有迭代码集合的平均性能比所有二进制系统线性分组码的平均性能差。福尼(g.d. Forney, Jr.)提出的串联码从实践和理论角度看都是非常重要的码。利用串接码的特征结构,在不知道串接码二进制权分布的情况下,提出了一种近似良好的未检测错误概率的计算方法。由于该方法的计算复杂度不超过O(n),其中n为连接码的外层码的码长,因此从实际和理论角度研究连接码的错误检测能力是一种有效的方法。通过对一些代码实例的精确值与近似值的比较,我们证明了采用所提出方法求得的近似值的有效性。
英文摘要
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.
期刊论文(3)
专著(0)
科研奖励(0)
会议论文
西島 利尚: "2値に展開された一般化Reed-Solomon符号の集合族上に与えられる平均見逃し誤り確率の上界について"電子情報通信学会論文誌. Vol.J85A No.1. 137-140 (2002)
Toshihisa Nishijima:“关于广义 Reed-Solomon 码族扩展为二进制的平均遗漏错误概率的上限”,《电子、信息和通信工程师学会汇刊》卷 J85A 第 137 期。 140 (2002)
DOI:
--
发表时间:
期刊:
影响因子:
--
作者:
[]
通讯作者:
Toshihisa Nishijima: "An Upper Bound on the Average Probability of Undetected Error for the Ensemble of Binary Expansions of Generalized Reed-Solomon Codes"The Transactions of The Institute of Electronics, Information and Communication Engineers A. Vol.J8
Toshihisa Nishijima:“广义里德-所罗门码二进制展开系综未检测到错误的平均概率的上限”电子、信息和通信工程师学会汇刊 A. Vol.J8
DOI:
--
发表时间:
期刊:
影响因子:
--
作者:
[]
通讯作者:
Shannon's channel coding problems from points of view of both information theory and algebraic coding theory
-
批准号:20560372
-
项目类别:Grant-in-Aid for Scientific Research (C)
-
资助金额:$1.83万
-
财政年份:2008
-
负责人:NISHIJIMA Toshihisa
-
依托单位:
Approach to Some Open Problems about Shannon's Channel Coding Theorem
-
批准号:16560348
-
项目类别:Grant-in-Aid for Scientific Research (C)
-
资助金额:$1.54万
-
财政年份:2004
-
负责人:NISHIJIMA Toshihisa
-
依托单位: