Title :
Fast calculation of the number of minimum-weight words of CRC codes
Author_Institution :
Bulgarian Acad. of Sci., Veliko Tarnovo, Bulgaria
fDate :
3/1/2001 12:00:00 AM
Abstract :
We investigate the most important parameter of the function of undetected error probability for shortened binary cyclic codes. This parameter is Ad, the number of minimum-weight words. A fast method for calculation of Ad is presented. Our approach does not require calculation of the distance distribution of dual codes as most of the known methods do
Keywords :
Hamming codes; binary codes; cyclic codes; error detection codes; CRC codes; Hamming codes; cyclic redundancy check codes; minimum-weight words; shortened binary cyclic codes; undetected error probability; Circuit theory; Cyclic redundancy check; Cyclic redundancy check codes; Error analysis; Error probability; IEC standards; Information theory;
Journal_Title :
Information Theory, IEEE Transactions on
