國立臺灣大學電信工程研究所Lin, Mao-ChaoMao-ChaoLin2006-11-142018-07-052006-11-142018-07-051990-09http://ntur.lib.ntu.edu.tw//handle/246246/200611150121007The (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 .application/pdf267696 bytesapplication/pdfzh-TWBounds on the Undetected Error Probabilities of Linear Codes for Both Error Correction and Detectionjournal articlehttp://ntur.lib.ntu.edu.tw/bitstream/246246/200611150121007/1/10563.pdf