By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
P. Kazakov ; Bulgarian Acad. of Sci., Veliko Tarnovo, Bulgaria

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

Published in:

IEEE Transactions on Information Theory  (Volume:47 ,  Issue: 3 )