Bounds on the Undetected Error Probabilities of Linear Codes for Both Error Correction and Detection
Resource
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL.. 36, NO. 5, SEPTEMBER 1990
Journal
IEEE Transactions on Information Theory
Journal Volume
VOL.. 36
Journal Issue
NO. 5
Pages
-
Date Issued
1990-09
Date
1990-09
Author(s)
DOI
246246/200611150121007
Abstract
The (n, k, d 2 2t + 1) binary linear codes are studied, 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"-k - n ] - l when used on a
binary symmetric channel with transition probability less than 2 / n .
Publisher
Taipei:National Taiwan University DEPT ELECT ENGN
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
10563.pdf
Size
261.42 KB
Format
Adobe PDF
Checksum
(MD5):bbfeb5e944470b82d97a70690685c284