On computing undetected error probabilities on the Gilbert channel

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.