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

Finding short and light codewords in BCH 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

3 Author(s)
Hernquist, E. ; Electr. Eng. Dept., Johns Hopkins Univ., Laurel, MD, USA ; Newhart, D. ; Stong, R.A.

A new algorithm is presented for finding codewords that are of low weight (“light”) and low degree (“short”) in narrow-sense binary BCH codes of length n=2m-1 and minimum weight d=2t-1, for use in serial implementations. This improves on some earlier results by Roth and Scroussi (see ibid., vol.34, p.593-6, May 1998), and extends the range of parameters to include cases of interest for long CRC (cyclic redundancy codes) error-detection schemes

Published in:

Information Theory, IEEE Transactions on  (Volume:45 ,  Issue: 1 )

Date of Publication:

Jan 1999

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.