On Capacity Regions of Discrete Asynchronous Multiple Access Channels

zbMath1395.94250arXiv1204.2447MaRDI QIDQ5179073

Lóránt Farkas, Tamás Kói

Publication date: 19 March 2015

Full work available at URL: https://arxiv.org/abs/1204.2447

zbMATH Keywords

delayrate splittingmultiple-accesssuccessive decodingpartly asynchronous

Mathematics Subject Classification ID

Information theory (general) (94A15) Channel models (including quantum) in information and communication theory (94A40)

Cites Work

• Unnamed Item
• On metric properties of maps between Hamming spaces and related graph homomorphisms
• Coding in an asynchronous multiple-access channel
• Network Information Theory
• Multiple-access channels with memory with and without frame synchronism
• Asynchronous multiple-access channel capacity
• Sliding-block joint source/noisy-channel coding theorems
• A note on the capacity region of the multiple-access channel (Corresp.)
• Rate-splitting multiple access for discrete memoryless channels
• Generalized time sharing: a low-complexity capacity-achieving multiple-access technique
• Multiaccess fading channels. I. Polymatroid structure, optimal resource allocation and throughput capacities
• Communication Under Strong Asynchronism
• The capacity region of the totally asynchronous multiple-access channel
• Information Theory

This page was built for publication: On Capacity Regions of Discrete Asynchronous Multiple Access Channels