Fast calculation of the number of minimum-weight words of CRC codes

Abstract

We investigate the most important parameter of the function of undetected error probability for shortened binary cyclic codes. This parameter is A/sub d/, the number of minimum-weight words. A fast method for calculation of A/sub d/ is presented. Our approach does not require calculation of the distance distribution of dual codes as most of the known methods do.