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

Asymptotically Good Nonlinear Codes From Algebraic Curves

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

1 Author(s)
Chaoping Xing ; Sch. of Phys. & Math. Sci., Nanyang Technol. Univ., Singapore, Singapore

By employing algebraic curves, we give some new asymptotic bounds for (q-1)-ary and (q+1)-ary codes, where q >; 2 is a prime power. In particular, our asymptotic bound for (q-1)-ary codes improves on the bound obtained directly from alphabet restriction given by Tafasman and Vlăduţ , [Th. 1.3.19], while our asymptotic bound for (q+1) -ary codes includes Elkies' result for the square q case (STOC 01) (however, the idea in this paper is different from Elkies' one). Our constructions of asymptotically good nonlinear codes are NOT the same as Goppa's construction of algebraic geometry codes in the sense that we consider evaluation of functions at some pole points as well.

Published in:

Information Theory, IEEE Transactions on  (Volume:57 ,  Issue: 9 )

Date of Publication:

Sept. 2011

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.