Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Footprints or generalized Bezout's 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)
Geil, O. ; Dept. of Math. Sci., Aalborg Univ., Denmark ; Hoholdt, T.

In two previous papers, the first by Feng, Rao, Berg, and Zhu (see ibid., vol.43, p.1799-810, 1997) and the second by Feng, Zhu, Shi, and Rao (see Proc. 35th. Afferton Conf. Communication, Control and Computing, p.205-14, 1997), the authors use a generalization of Bezout's theorem to estimate the minimum distance and generalized Hamming weights for a class of error correcting codes obtained by evaluation of polynomials in points of an algebraic curve. The main aim of this article is to show that instead of using this rather complex method the same results and some improvements can be obtained by using the so-called footprint from Grobner basis theory. We also develop the theory further such that the minimum distance and the generalized Hamming weights not only can be estimated but also can actually be determined

Published in:

Information Theory, IEEE Transactions on  (Volume:46 ,  Issue: 2 )