Undetected error probability performance of cyclic redundancy-check codes of 16-bit redundancy

The authors investigate the performance of cyclic redundancy check (CRC) codes generated by polynomials of degree 16 over GF(2) which can be used for pure error detection in communication systems. Their minimum distance, properness and undetected error probability for binary symmetric channels (BSCs) are computed and comparison with the existing standards is made.