Coset codes for multiple access channels with common information based on LDPC codes

Hideki Yagi; H. Vincent Poor

doi:10.1109/ISIT.2010.5513450

Coset codes for multiple access channels with common information based on LDPC codes

Hideki Yagi, H. Vincent Poor

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

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	https://doi.org/10.1109/ISIT.2010.5513450
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

Access to Document

10.1109/ISIT.2010.5513450

Cite this

@inproceedings{08ceedb30b78490c8ae39a80233022ca,

title = "Coset codes for multiple access channels with common information based on LDPC codes",

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.",

author = "Hideki Yagi and Poor, {H. Vincent}",

year = "2010",

month = aug,

day = "23",

doi = "10.1109/ISIT.2010.5513450",

language = "English (US)",

isbn = "9781424469604",

pages = "475--479",

booktitle = "2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings",

note = "2010 IEEE International Symposium on Information Theory, ISIT 2010 ; Conference date: 13-06-2010 Through 18-06-2010",

}

TY - GEN

T1 - Coset codes for multiple access channels with common information based on LDPC codes

AU - Yagi, Hideki

AU - Poor, H. Vincent

PY - 2010/8/23

Y1 - 2010/8/23

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77955669520&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955669520&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2010.5513450

DO - 10.1109/ISIT.2010.5513450

M3 - Conference contribution

AN - SCOPUS:77955669520

SN - 9781424469604

SP - 475

EP - 479

BT - 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings

T2 - 2010 IEEE International Symposium on Information Theory, ISIT 2010

Y2 - 13 June 2010 through 18 June 2010

ER -

Coset codes for multiple access channels with common information based on LDPC codes

Abstract

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this