航空学报 > 1993, Vol. 14 Issue (7): 362-366

线性分组码不可检错误概率新的下限

徐大专   

  1. 南京航空航天大学计算机系 南京 210016
  • 收稿日期:1991-10-15 修回日期:1992-06-20 出版日期:1993-07-25 发布日期:1993-07-25

NEW LOWER BOUNDS FOR UNDETECTED ERROR PROBABILITY OF LINEAR BLOCK CODES

Xu Da-zhuan   

  1. Depart menu of comput, Nanjing University of Aeronautics and Astronautics, Nanjing, 210016
  • Received:1991-10-15 Revised:1992-06-20 Online:1993-07-25 Published:1993-07-25

摘要: 线性分组码的不可检错误概率是评价自动请求重传(ARQ)系统的重要参数。不可检错误概率的计算涉及码的重量分布,而大部分码的重量分布还不知道,因此,研究不可检错误概率的限显得非常重要。本文得到了GF()上(n,k)线性分组码不可检错误概率的两个新的下限,在一定程度上,改进了Wolf等人的结果。由于新的限与码的重量结构无关,因此可以方便地估计任何线性分组码的不可检错误概率。

关键词: 数字通信, 信息论, 纠错码, 不可检错误概率, 下限

Abstract: In this paper two new lower bounds of undetected error probability for (n, k) linear block codes in GF(q) are obtained. The Wolf and his c<> operative authors' results are improved to a certain extent. Because new lower bounds are not relative to the weight structure of the codes, it is easy to estimate undetected error probability of various linear block codes.

Key words: digital communication, information theory, error correcting code, undetected error probabilUy, lower bound