Abstract
Coding for discrete memoryless compound multiple access channels (MACs) with common information is considered. A construction method for an ensemble of MAC codes is proposed based on non-binary low-density parity check (LDPC) codes. It is shown that an overall MAC code asymptotically approaches the random coding exponent for the compound MAC with common information under joint maximum likelihood decoding. The analysis of decoding error probability shows that several regular LDPC codes which are good for a single-user channel are sufficient for achieving the random coding exponent or the capacity region for this channel.
Original language | English (US) |
---|---|
Title of host publication | 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings |
Pages | 475-479 |
Number of pages | 5 |
DOIs | |
State | Published - Aug 23 2010 |
Event | 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States Duration: Jun 13 2010 → Jun 18 2010 |
Other
Other | 2010 IEEE International Symposium on Information Theory, ISIT 2010 |
---|---|
Country/Territory | United States |
City | Austin, TX |
Period | 6/13/10 → 6/18/10 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics