On capacity regions of discrete asynchronous multiple access channels

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.

• Publication year

  2012

• Venue

  Kybernetika (Praha)

• Publication date

  2012-04-11

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.14736/kyb-2014-6-1003arXiv 1204.2447
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On asynchronous capacity and dispersion

  2012cited by this paper
• Capacity regions of partly asynchronous multiple access channels

  2012cited by this paper
• Information Theory: Multi-terminal systems

  2011influential reference
• Information Theory: Coding theorems for discrete memoryless systems, Second Edition

  2011influential reference
• Communication Under Strong Asynchronism

  2007cited by this paper
• Network Information Theory

  2001influential reference
• Rate-splitting multiple access for discrete memoryless channels

  2001influential reference
• Generalized time sharing: A low-complexity capacity-achieving multiple-access technique

  2001cited by this paper
• Multiaccess Fading Channels-Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities

  1998cited by this paper
• Constraints on capacity in a multi-user channel

  1994cited by this paper
• Multiple-access channels with memory with and without frame synchronism

  1989cited by this paper
• The capacity region of the totally asynchronous multiple-access channel

  1985influential reference
• Multiple Access Channels

  1978cited by this paper
• Sliding-block joint source/noisy-channel coding theorems

  1976influential reference
• Multi-way communication channels

  1973cited by this paper

• Help from space: grant-free massive access for satellite-based IoT in the 6G era

  2021cites this paper
• Information Rates on a Symbol-Asynchronous Multi-Access Channel

  2020cites this paper
• Quickest sequence phase detection

  2016cites this paper
• Universal error exponent for discrete asynchronous multiple access channels

  2014cites this paper
• Time-Asynchronous Gaussian Multiple Access Relay Channel With Correlated Sources

  2014cites this paper
• Asynchronous Joint Source-Channel Communication: An Information-Theoretic Perspective

  2014cites this paper
• Asynchronous Communication: Exact Synchronization, Universality, and Dispersion

  2013cites this paper
• Time-asynchronous Gaussian multiple access channel with correlated sources

  2013cites this paper
• Capacity regions of partly asynchronous multiple access channels

  2012cites this paper
• On asynchronous capacity and dispersion ( Invited paper )

  2012cites this paper
• A Cooperative Network Coding Strategy for the Interference Relay Channel

  2012cites this paper
• On asynchronous capacity and dispersion

  2012cites this paper
• Asynchronous communication : universality , strong converse and dispersion

  2012cites this paper