Cart (Loading....) | Create Account
Close category search window
 

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

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 $31
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

3 Author(s)
Baicheva, T. ; Inst. of Math. & Inf., Bulgarian Acad. of Sci., Veliko Tarnovo, Bulgaria ; Dodunekov, S. ; Kazakov, P.

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

Published in:

Communications, IEE Proceedings-  (Volume:147 ,  Issue: 5 )

Date of Publication:

Oct 2000

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.