Related Experiment Video
Updated: Aug 13, 2025

Quasi-light Storage for Optical Data Packets
Published on: February 6, 2014
The Strongly Asynchronous Massive Access Channel
Sara Shahi1, Daniela Tuninetti1, Natasha Devroye1
1Electrical and Computer Engineering Department, University of Illinois at Chicago, Chicago, IL 60607, USA.
Abstract:
This paper considers the Strongly Asynchronous, Slotted, Discrete Memoryless, Massive Access Channel (SAS-DM-MAC) in which the number of users, the number of messages, and the asynchronous window length grow exponentially with the coding blocklength with their respective exponents. A joint probability of error is enforced, ensuring that all the users' identities and messages are correctly identified and decoded. Achievability bounds are derived for the case that different users have similar channels, the case that users' channels can be chosen from a set which has polynomially many elements in the blocklength, and the case with no restriction on the users' channels. A general converse bound on the capacity region and a converse bound on the maximum growth rate of the number of users are derived. It is shown that reliable transmission with an exponential number of users with an exponential asynchronous exponent with joint error probability is possible at strictly positive rates.
Related Concept Videos
Cable Subjected to a Distributed Load
Distributed Loads
For example, consider a bookshelf filled with books stacked vertically adjacent to each other. The weight of the books is evenly distributed over the length of the shelf. As a result, the pressure at different locations on the surface of the...
Parallel Processing
Fast Decoupled and DC Powerflow
Rapidly Varying Flow
Buffers: Buffer Capacity
In the graph, pH is plotted as a function of the number of moles of base (Cb) added to a weak...

