Bounds on the Undetected Error Probabilities of Linear Codes for Both Error Correction and Detection
Journal
IEEE Transactions on Information Theory
Journal Volume
36
Journal Issue
5
Pages
1139-1141
Date Issued
1990
Author(s)
Abstract
The author investigates the (n, k, d>or=2t+1) binary linear codes, which are used for correcting error patterns of weight at most t and detecting other error patterns over a binary symmetric channel. In particular, for t=1, it is shown that there exists one code whose probability of undetected errors is upper-bounded by (n+1) (2/sup n-k/-n)/sup -1/ when used on a binary symmetric channel with transition probability less than 2/n.>
Type
journal article