By Topic

Fast calculation algorithm of the undetected errors probability 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
$31 $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

2 Author(s)
Ren-Der Lin ; Dept. of Comput. Sci., National Chung-Hsing Univ., Taichung, Taiwan ; Wen-Shyen Chen

The error detecting functions of linear block code can be realized via simple software or hardware. The error detection, which includes long-term theoretical research and many good properties, is often applied widely in digital communication and data storage. The weight distribution of linear block code and its dual code are important parameters of calculating the probability Pud of undetected errors. Further, cyclic redundancy check (CRC) codes and Bose, Chaudhuri and Hocquenghem (BCH) cyclic codes are subclasses of linear block codes. This paper proposes a fast calculation algorithm of weight distribution of the dual code which outperforms those of previous studies in time complexity, and the probability of undetected error of different CRC codes standards under various codeword lengths are also simulated efficiently.

Published in:

Advanced Information Networking and Applications, 2005. AINA 2005. 19th International Conference on  (Volume:2 )

Date of Conference:

28-30 March 2005