Title :
On the undetected error probability for binary codes
Author :
Fu, Fang-Wei ; Kløve, Torleiv ; Wei, Victor K W
Author_Institution :
Dept. of Math., Nankai Univ., Tianjin, China
Abstract :
In this paper, the undetected error probability for binary codes is studied. A new proof of Abdel-Ghaffar´s (see IEEE Trans. Inform. Theory, vol.43, no.5, p.1489-1502, Sept. 1997) lower bound on the undetected error probability is presented. Further, a lower bound for the binomial moments of the distance distribution of binary constant weight codes is derived, and this yields a lower bound on the undetected error probability for binary constant weight codes. Finally, a lower bound on the undetected error probability of binary linear codes for single-error correction and detection of further errors is presented
Keywords :
binary codes; error correction codes; error detection codes; error statistics; linear codes; Abdel-Ghaffar lower bound; binary codes; binary constant weight codes; binary linear codes; binomial moments; distance distribution; single-error correction; single-error detection; undetected error probability; Binary codes; Councils; Error correction; Error correction codes; Error probability; Feedback communications; Informatics; Linear code; Mathematics;
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
DOI :
10.1109/ISIT.2001.936017
