Coset codes for compound multiple access channels with common information

Authors:
Hideki Yagi;H. Vincent Poor
Affiliations:
ER Center for Frontier Science, The University of Electro-Communications, Chofu-shi, Tokyo, Japan;Department of Electrical Engineering, Princeton University, Princeton, NJ
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Year:
2009

Citing 7
Cited 0

Elements of information theory

Elements of information theory
Information Theory and Reliable Communication

Information Theory and Reliable Communication
Linear-codes-based lossless joint source-channel coding for multiple-access channels

IEEE Transactions on Information Theory
Random coding techniques for nonrandom codes

IEEE Transactions on Information Theory
On the application of LDPC codes to arbitrary discrete-memoryless channels

IEEE Transactions on Information Theory
Low-density parity-check matrices for coding of correlated sources

IEEE Transactions on Information Theory
Capacity of Interference Channels With Partial Transmitter Cooperation

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper considers code construction for arbitrary discrete memoryless compound multiple access channels (MACs) with common information. This class of channels includes a MAC with/without common messages or with partially cooperating encoders. A construction method of code ensembles based on coset codes is proposed for these channels. Assuming joint maximum likelihood decoding, the performance of the proposed code ensemble is analyzed by deriving error exponents. A condition is shown such that codes achieve the capacity region on average. The result obtained here reduces to the result of Slepian and Wolf or other conventional works if restricted to a single MAC. A combination of good linear codes gives capacity achieving codes for compound MACs with common messages or with partially cooperating encoders.