On capacity regions of discrete asynchronous multiple access channels

zbMATH Open1395.94250arXiv1204.2447MaRDI QIDQ5179073FDOQ5179073

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

Publication date: 19 March 2015

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.

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

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

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

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

Cited In (9)

• 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
• Title not available (Why is that?)
• Coding in an asynchronous multiple-access channel
• 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)