Tight Bounds on the Capacity of Binary Input random CDMA Systems

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Despite the widespread empirical success of ResNet, the generalization properties of deep ResNet are rarely explored beyond the lazy training regime. In this work, we investigate scaled ResNet in the limit of infinitely deep and wide neural networks, of wh ...

Under the trends of multifunctionality, tunability, and compactness in modern wave -based signal processors, in this paper, we propose a polarization-multiplexed graphene-based metasurface to realize distinct mathematical operators on the parallel time-dom ...

In this study, leaf and soil samples were used as bio-monitors for different alkali and heavy metals at six different locations in Kyiv city. Using x–y plots of the inductively coupled plasma optical emission spectroscopy (ICP-OES) data measured the discre ...

LoRaWAN is a low-power wireless technology that provides long-range connectivity to battery-powered Internet of Things (IoT) devices. To minimize the energy consumption of the IoT nodes, LoRaWAN networks use for the uplink a pure non-slotted ALOHA multiple ...

The maximal achievable advantage of a (computationally unbounded) distinguisher to determine whether a source

Z

is distributed according to distribution

P_0

P_1

, when given access to one sample of

Z

, is characterized by the statistical distance ...

We study a mechanism design problem where an indivisible good is auctioned to multiple bidders, for each of whom it has a private value that is unknown to the seller and the other bidders. The agents perceive the ensemble of all bidder values as a random v ...

Computation codes in network information theory are designed for scenarios where the decoder is not interested in recovering the information sources themselves, but only a function thereof. Körner and Marton showed for distributed source coding (DSC) that ...

We present a practical strategy that aims to attain rate points on the dominant face of the multiple access channel capacity using a standard low complexity decoder. This technique is built upon recent theoretical developments of Zhu and Gastpar on compute ...

We derive sharp probability bounds on the tails of a product of symmetric non-negative random variables using only information about their first two moments. If the covariance matrix of the random variables is known exactly, these bounds can be computed nu ...

Over the last few years, residential and enterprise networking have faced several challenges due to the increasing demand of users for high-throughput connectivity. As a result, efforts are being made to improve coverage, throughput, and robustness. Severa ...

For a two-user Gaussian multiple access channel, computation codes are designed for the scenarios where the decoder is not interested in decoding the two codewords, but only the sum of them. It has been observed that good computation codes should possess s ...

A time-division multiplexing (TDM) digital channel coding scheme for wireline multi-drop interfaces has been proposed. Shaping the TX spectrum to avoid channel frequency notches, the proposed digital TDM signaling reduces inter-symbol interference (ISI) an ...

Inspired by the compute-and-forward scheme from Nazer and Gastpar, a novel multiple-access scheme introduced by Zhu and Gastpar makes use of nested lattice codes and sequential decoding of linear combinations of codewords to recover the individual messages ...

A time-division multiplexing (TDM) digital channel coding scheme with inter-symbol interference (ICI) reduction property for multi-drop memory interfaces has been proposed. Shaping the TX spectrum to avoid channel frequency notches, the proposed digital TD ...

Information theory is the field in which we study the fundamental limitations of communication. Shannon proved in 1948 that there exists a maximum rate, called capacity, at which we can reliably communicate information through a given channel. However, Sha ...

Single-emulsion toluene oil droplets (femtoliter) containing a hydrophobic redox probe that are dispersed in water stochastically collide with an ultramicroelectrode (UME). The fast-scan cyclic voltammetry (FSCV) or Fourier-transformed sinusoidal voltammet ...

The steady growth of capacity demand in telecommunication networks has sparked the development of various photonic devices for ultrafast optical signal processing functions to meet the requirements of future flexible fiber networks in general and backbone ...

Various aspects of the built environment have important effects on ecology. Providing suitable metrics for the built forms so as to quantify and model their internal relations and external ecological footprints, however, remains a challenge. Here we provid ...

We establish the existence of wave-like solutions to spatially coupled graphical models which, in the large size limit, can be characterized by a 1-D real-valued state. This is extended to a proof of the threshold saturation phenomenon for all such models, ...

This paper studies the second-order asymptotics of coding rates for the discrete memoryless multiple-access channel (MAC) with a fixed target error probability. Using constant-composition random coding, coded time-sharing, and a variant of Hoeffding's comb ...

Tight Bounds on the Capacity of Binary Input random CDMA Systems

Chat with Graph Search

Generalization of Scaled Deep ResNets in the Mean-Field Regime

Parallel temporal signal processing enabled by polarization-multiplexed programmable THz metasurfaces

Elemental and Thermo-gravimetric Characterization of Trace Metals in Leaves and Soils as Bioindicators of Pollution in Kyiv City

Enhancing the Reliability of Dense LoRaWAN Networks With Multi-User Receivers

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples

Distributionally Robust Mechanism Design

Communication Versus Computation: Duality for Multiple-Access Channels and Source Coding

Compute–Forward Multiple Access (CFMA): Practical Implementations

Chebyshev Inequalities for Products of Random Variables

Improving Throughput, Latency and Privacy with Hybrid Networks and Multipath Routing

On the Duality between Multiple-Access Codes and Computation Codes

A Time-Division Multiplexing Signaling Scheme for Low-Power Multi-Drop Memory Links

Compute-forward multiple access (CFMA) with nested LDPC codes

A Time-Division Multiplexing Signaling Scheme for Inter-Symbol/Channel Interference Reduction in Low-Power Multi-Drop Memory Links

Polarization and Channel Ordering: Characterizations and Topological Structures

Single Organic Droplet Collision Voltammogram via Electron Transfer Coupled Ion Transfer

Optical Signal Processing and Pulse Shaping for Wavelength Multiplexed High Speed Communication Systems

Statistical-thermodynamics modelling of the built environment in relation to urban ecology

Wave-Like Solutions of General 1-D Spatially Coupled Systems

Second-Order Rate Region of Constant-Composition Codes for the Multiple-Access Channel