DocumentCode
1229966
Title
On computing undetected error probabilities on the Gilbert channel
Author
Wong, Brenden ; Leung, Cyril
Author_Institution
Dept. of Electr. Eng., British Columbia Univ., Vancouver, BC, Canada
Volume
43
Issue
11
fYear
1995
fDate
11/1/1995 12:00:00 AM
Firstpage
2657
Lastpage
2661
Abstract
Two methods for computing the probability of undetected error on the Gilbert (1960) channel are examined. First, using a method proposed by Kittel (1978), we study some standard cyclic redundancy codes and compare the results with those on the binary symmetric channel. Then we consider a general method of approximate code evaluation, proposed by Elliott, which involves P(m, n), the probability of m errors in a block of length n bits. A nonrecursive technique for computing P(m, n) on the Gilbert channel is described
Keywords
coding errors; cyclic codes; error statistics; probability; telecommunication channels; Gilbert channel; approximate code evaluation; binary symmetric channel; cyclic redundancy codes; error detecting code; nonrecursive technique; undetected error probabilities; Block codes; Code standards; Communications Society; Cyclic redundancy check; Cyclic redundancy check codes; Data communication; Integrated circuit modeling; Parity check codes;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/26.481214
Filename
481214
Link To Document