Referenced Items are not available for this document.
In this work, a new upper bound for average error probability of a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound can be universally obtained for all discrete memoryless MACs with given input and output alphabets. This is the first bound of this type that explicitly uses the method of expurgation. It is shown that the exponent of this bound is greater than or equal to those of previously known bounds.
Published in:
Information Sciences and Systems, 2009. CISS 2009. 43rd Annual Conference on
Date of Conference: 18-20 March 2009
- Page(s):
- 295 - 300
- E-ISBN :
- 978-1-4244-2734-5
- Print ISBN:
- 978-1-4244-2733-8
- INSPEC Accession Number:
- 10685239
- Conference Location :
- Baltimore, MD
- Digital Object Identifier :
- 10.1109/CISS.2009.5054734
- Product Type:
- Conference Publications
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.
