An efficient technique for detecting catastrophic convolutional codes

Catastrophic convolutional codes (CC) cause an infinite number of decoded data bit errors when decoding a finite number of code symbols. A CC displays a catastrophic error propagation if the generating polynomials have a common factor. An efficient algorithm for polynomial factorization in GF(2^m) is used for detecting catastrophic CC for any rate n/m and constraint length k. A general formula is derived to calculate the number of catastrophic codes in any (m, n, k) CC.