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

More on the minimum distance of cyclic 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)
de Rooij, P.J.N. ; PTT Research Neher Lab., Leidschendam, Netherlands ; van Lint, J.H.

It was recently shown that the so-called Jensen bound is generally weaker than the product method and the shifting method introduced by van Lint and Wilson (1986). It is shown that the minimum distance of the two cyclic codes of length 65 (for which it is known that the product method does not produce the desired result) can be proved using Jensen's method (1985) with some adaptations

Published in:

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

Date of Publication:

Jan 1991

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.