By Topic

A new approach to determine a lower bound of generalized Hamming weights using an improved Bezout theorem

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)
Gui-Liang Feng ; Center for Adv. Comput. Studies, Univ. of Southwestern Louisiana, Lafayette, LA, USA ; Rao, T.R.N.

A new approach to determine a lower bound for the generalized Hamming weights of algebraic-geometric (AG) codes is discussed. Using this new approach, some more efficient linear codes with the minimum distances 4, 5, 6 and any lengths over GF(2m), and some more efficient AG codes have also been constructed

Published in:

Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on

Date of Conference:

17-22 Sep 1995