@article {Agarwal1992Computing-the-p,
title = {Computing the probability of undetected error for shortened cyclic codes},
journal = {Communications, IEEE Transactions on},
volume = {40},
number = {3},
year = {1992},
month = {mar.},
pages = {494 -499},
abstract = {The authors present a general technique for computing P e for all possible shortened versions of cyclic codes generated by any given polynomial. The technique is recursive, i.e. computes Pe for a given code block length n from that of the code block length n-1. The proposed computation technique for determining Pe does not require knowledge of the code weight distributions. For a generator polynomial of degree r, and |g| nonzero coefficients, the technique yields Pe for all code block lengths up to length n in time complexity O(n|g |2r+|g|). Channels with variable bit error probabilities can be analyzed with the same complexity. This enables the performance of the code generator polynomials to be analyzed for burst errors},
keywords = {bit error probabilities, burst errors, channels, code block length, code generator polynomials, error detection codes, linear block codes, probability, recursive method, shortened cyclic codes, telecommunication channels, time complexity},
issn = {0090-6778},
doi = {10.1109/26.135719},
url = {http://dx.doi.org/10.1109/26.135719},
author = {Agarwal, V.K. and Ivanov, A.}
}