On the undetected error probability for binary codes

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI:10.1109/ISIT.2001.936017

Fang-Wei Fu, T. Kløve, V. Wei

引用次数: 15

Abstract

In this paper, the undetected error probability for binary codes is studied. A new proof of Abdel-Ghaffar's (see IEEE Trans. Inform. Theory, vol.43, no.5, p.1489-1502, Sept. 1997) lower bound on the undetected error probability is presented. Further, a lower bound for the binomial moments of the distance distribution of binary constant weight codes is derived, and this yields a lower bound on the undetected error probability for binary constant weight codes. Finally, a lower bound on the undetected error probability of binary linear codes for single-error correction and detection of further errors is presented.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

关于二进制代码未检测到的错误概率

本文研究了二进制码的未检测错误概率。Abdel-Ghaffar的新证明(参见IEEE Trans)。通知。理论，第43卷，no。(5)， p.1489-1502, Sept. 1997)给出了未检测误差概率的下界。进一步，导出了二元常权码距离分布的二项式矩的下界，从而得到了二元常权码的未检测错误概率的下界。最后，给出了二元线性码的单错误校正和进一步错误检测的未检测错误概率的下界。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)

自引率

0.00%

发文量

期刊最新文献

A simple encodable/decodable OFDM QPSK code with low peak-to-mean envelope power ratio The effect of redundancy on measurement Decision directed algorithms for multiuser detection A new modulation scheme using asymmetric error correcting code embedded in optical orthogonal code for optical CDMA Matrix CUSUM: a recursive multi-hypothesis change detection algorithm