Referenced Items are not available for this document.
An explicit construction of a sequence of binary codes that asymptotically meet the Zyablov bound for rates lower than 0.30 is given by using Justesen's construction of concatenation. The outer codes are constructed from generalized Hermitian curves. These outer codes can be described without any algebraic geometry terminology, while the proofs of some properties deeply rely on algebraic geometry
Published in:
Information Theory, IEEE Transactions on
(Volume:39
,
Issue:
1
)
Date of Publication: Jan 1993
- Page(s):
- 239 - 242
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 4384049
- Digital Object Identifier :
- 10.1109/18.179365
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Jan 1993
- Sponsored by :
- IEEE Information Theory Society
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
