DocumentCode :
924745
Title :
Concerning a bound on undetected error probability (Corresp.)
Author :
Leung-yan-cheong, S.K. ; Hellman, Martin E.
Volume :
22
Issue :
2
fYear :
1976
fDate :
3/1/1976 12:00:00 AM
Firstpage :
235
Lastpage :
237
Abstract :
In the past, it has generally been assumed that the probability of undetected error for an 
block code, used solely for error detection on a binary symmetric channel, is upperbounded by 
. In this correspondence, it is shown that Hamming codes do indeed obey this bound, but that the bound is violated by some more general codes. Examples of linear, cyclic, and Bose-Chaudhuri-Hocquenghem (BCH) codes which do not obey the bound are given.
block code, used solely for error detection on a binary symmetric channel, is upperbounded by . In this correspondence, it is shown that Hamming codes do indeed obey this bound, but that the bound is violated by some more general codes. Examples of linear, cyclic, and Bose-Chaudhuri-Hocquenghem (BCH) codes which do not obey the bound are given.Keywords :
Binary symmetric channels; Error-detecting codes; Block codes; Decoding; Error analysis; Error correction codes; Error probability; Parity check codes;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1976.1055515
Filename :
1055515
Link To Document :
