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

Transitive and self-dual codes attaining the Tsfasman-Vla˘dut$80-Zink bound

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)
Stichtenoth, H. ; Sabanci Univ., Istanbul

A major problem in coding theory is the question of whether the class of cyclic codes is asymptotically good. In this correspondence-as a generalization of cyclic codes-the notion of transitive codes is introduced (see Definition 1.4 in Section I), and it is shown that the class of transitive codes is asymptotically good. Even more, transitive codes attain the Tsfasman-Vlabrevedut$80-Zink bound over Fq, for all squares q=l2. It is also shown that self-orthogonal and self-dual codes attain the Tsfasman-Vlabrevedut$80-Zink bound, thus improving previous results about self-dual codes attaining the Gilbert-Varshamov bound. The main tool is a new asymptotically optimal tower E0subeE1 subeE2sube middotmiddotmiddot of function fields over Fq (with q=lscr2), where all extensions En/E0 are Galois

Published in:

Information Theory, IEEE Transactions on  (Volume:52 ,  Issue: 5 )

Date of Publication:

May 2006

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.