Publication
Computation over multiple-access channels
Related publications (40)
Polar codes for channel and source coding
The two central topics of information theory are the compression and the transmission of data. Shannon, in his seminal work, formalized both these problems and determined their fundamental limits. Since then the main goal of coding theory has been to find ...
EPFL2009Cooperative coding on orthogonal information networks
The focus of this thesis is on communication over cooperative information networks. In the first half of the thesis, we consider lossy source coding problems where a relay assists in the communication of a source stream between two terminals. The following ...
EPFL2009Efficient MAC in cognitive radio systems: A game-theoretic approach
Jean-Pierre Hubaux, Mark Felegyhazi, Mario Cagalj
In this paper, we study the problem of efficient medium access control (MAC) among cognitive radio devices that are equipped with multiple radios and thus are capable of transmitting simultaneously at different frequencies (channels). We assume that radios ...
2009Structured random codes and sensor network coding theorems
In the Shannon-theoretic analysis of joint source-channel coding problems, achievability is usually established via a two-stage approach: The sources are compressed into bits, and these bits are reliably communicated across the noisy channels. Random codin ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008Diversity embedding for broadband communication
Given uncertainty in environment, a conservative approach is to design for the worst case, leading to a game-theoretic situation where the environment is controlled by an adversary. However, in many cases, the uncertainty arises from randomness, not an adv ...
EPFL2008Computation over Multiple-access Channels
The problem of reliably reconstructing a function of sources over a multiple-access channel (MAC) is considered. It is shown that there is no source-channel separation theorem even when the individual sources are independent. Joint source-channel strategie ...
Institute of Electrical and Electronics Engineers2007Delay and coding in multiple-user communications
In multiple-user communications, the bursty nature of the packet arrival times cannot be divorced from the analysis of the transmission process. However, in traditional information theory the random arrival times are smoothed out by appropriated source cod ...
EPFL2007The case for structured random codes in network communication theorems
In the Shannon-theoretic analysis of joint source-channel coding problems, achievability is usually established via a two-stage approach: The sources are compressed into bits' and these bits are reliably communicated across the noisy channels. Random codin ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007On the concentration of the capacity for a code division multiple access system
Nicolas Macris, Satish Babu Korada
We prove the concentration of the capacity, in the large system limit, for a code division multiple access system over an additive white Gaussian noise channel, with Gaussian signature sequences and {\it binary input} symbols. The probabilistic tools that ...
2007On capacity under receive and spatial spectrum-sharing constraints
Capacity is often studied under constraints on the channel input signals. This paper investigates the behavior of capacity when constraints are placed on the! channel output signal (as well as generalizations thereof). While such a change in perspective le ...
2007