Referenced Items are not available for this document.
An asymptotic lower bound on the rates of two-level binary codes with unequal error protection is presented. The bound is based on a class of codes that are constructive in the sense that the description complexity is polynomial in the codeword length. In some cases, the bound exceeds an upper bound for linear codes, proving the existence of constructive nonlinear UEP codes that are better than any linear codes
Published in:
Information Theory, IEEE Transactions on
(Volume:43
,
Issue:
2
)
Date of Publication: Mar 1997
- Page(s):
- 715 - 721
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 5522897
- Digital Object Identifier :
- 10.1109/18.556129
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Mar 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.
