On capacity regions of discrete asynchronous multiple access channels
From MaRDI portal
(Redirected from Publication:5179073)
Abstract: A general formalization is given for asynchronous multiple access channels which admits different assumptions on delays. This general framework allows the analysis of so far unexplored models leading to new interesting capacity regions. In particular, a single letter characterization is given for the capacity region in case of 3 senders, 2 synchronous with each other and the third not synchronous with them.
Recommendations
- Multiple-access channels with memory with and without frame synchronism
- The capacity region of the symbol-asynchronous Gaussian multiple-access channel
- Coding in an asynchronous multiple-access channel
- Rate-splitting multiple access for discrete memoryless channels
- On the capacity of the asynchronous T-user M-frequency noiseless multiple-access channel without intensity information
Cites work
- scientific article; zbMATH DE number 3438733 (Why is no real title available?)
- A note on the capacity region of the multiple-access channel (Corresp.)
- Asynchronous multiple-access channel capacity
- Coding in an asynchronous multiple-access channel
- Communication Under Strong Asynchronism
- Generalized time sharing: a low-complexity capacity-achieving multiple-access technique
- Information theory. Coding theorems for discrete memoryless systems
- Multiaccess fading channels. I. Polymatroid structure, optimal resource allocation and throughput capacities
- Multiple-access channels with memory with and without frame synchronism
- Network information theory
- On metric properties of maps between Hamming spaces and related graph homomorphisms
- Rate-splitting multiple access for discrete memoryless channels
- Sliding-block joint source/noisy-channel coding theorems
- The capacity region of the totally asynchronous multiple-access channel
Cited in
(10)- The capacity region of the symbol-asynchronous Gaussian multiple-access channel
- On the asymptotic capacity of a multi-access channel
- Multiple-access channels with memory with and without frame synchronism
- Upper bounds and constructions of complete asynchronous channel hopping systems
- scientific article; zbMATH DE number 5454710 (Why is no real title available?)
- Coding in an asynchronous multiple-access channel
- A model of restricted asynchronous multiple access in the presence of errors
- Generalized time sharing: a low-complexity capacity-achieving multiple-access technique
- Constructive Bounds on the Capacity of Parallel Asynchronous Skew-Free Channels With Glitches
- Rate-splitting multiple access for discrete memoryless channels
This page was built for publication: On capacity regions of discrete asynchronous multiple access channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5179073)
