ON SOME PROPERTIES OF THE UNDETECTED ERROR PROBABILITY OF LINEAR CODES

被引：47

作者：

LEUNGYANCHEONG, SK ^{[1
]}

BARNES, ER ^{[1
]}

FRIEDMAN, DU ^{[1
]}

机构：

[1] MIT,ELECTR SYST LAB,CAMBRIDGE,MA 02139

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1979年 / 25卷 / 01期

关键词：

D O I：

10.1109/TIT.1979.1055991

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A recent paper [1] discussed the 2-P bound (where p = n-k) for the probability of undetected error P() for an (n, k) block code used for error detection on a binary symmetric channel. This investigation is continued and extended and dual codes are studied. The dual and extension of a perfect code obey the 2-Pbound, but this is not necessarily true for arbitrary codes that obey the bound. Double-error-correcting BCH codes are shown to obey the bound. Finally the problem of constructing uniformly good codes is examined. © 1979 IEEE

引用

页码：110 / 112

页数：3