Referenced Items are not available for this document.
This correspondence proposes an explicit construction of codes achieving capacity for arbitrary discrete memoryless channels. The proposed code is obtained by concatenating variable inner codes and an algebraic geometry code. Further, we clarify that the proposed code achieves the error exponent obtained by Forney for concatenated codes
Published in:
Information Theory, IEEE Transactions on
(Volume:43
,
Issue:
3
)
Date of Publication: May 1997
- Page(s):
- 992 - 996
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 5574663
- Digital Object Identifier :
- 10.1109/18.568709
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- May 1997
- 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.
