DeepAI AI Chat
Log In Sign Up

Distributed Capacity of A Multiple Access Channel

by   Yanru Tang, et al.
Colorado State University

In distributed communication, each transmitter prepares an ensemble of channel codes. To encode a message, a transmitter chooses a channel code individually without sharing the coding choice with other transmitters or with the receiver. Upon receiving the block of channel output symbols, the receiver either decodes the messages of interest if a pre-determined reliability requirement can be met, or reports collision otherwise. Revised from the distributed channel coding theorems in the literature, distributed capacity of a discrete-time memoryless multiple access channel is defined and derived under the assumption that codeword length can be taken to infinity. An improved achievable error performance bound is presented for the case when codeword length is finite.


page 1

page 2

page 3

page 4


The Simultaneous Identification Capacity of the Classical--Quantum Multiple Access Channel

Here we discuss message identification, a problem formalized by Rudolf A...

Cooperative Multiple-Access Channels with Distributed State Information

This paper studies a memoryless state-dependent multiple access channel ...

On The Reliability Function of Discrete Memoryless Multiple-Access Channel with Feedback

We derive a lower and upper bound on the reliability function of discret...

On Lattice-Code based Multiple Access: Uplink Architecture and Algorithms

This paper studies a lattice-code based multiple-access (LCMA) framework...

Structure Learning of Sparse GGMs over Multiple Access Networks

A central machine is interested in estimating the underlying structure o...

Computation-aided classical-quantum multiple access to boost network communication speeds

A multiple access channel (MAC) consists of multiple senders simultaneou...

Uncoded Binary Signaling through Modulo AWGN Channel

Modulo-wrapping receivers have attracted interest in several areas of di...