A Comparison of Some Error Detecting CRC Code Standards

Abstract

Many data communication systems make use of cyclic redundancy check (CRC) codes for error detection purposes. In this paper, an asymptotic result concerning the undetected error probability <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">P(\epsilon)</tex> of CRC codes is derived. The <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">P(\epsilon)</tex> 's of a number of CRC codes which have been adopted as international standards are also examined.