Publication

Polar Codes for the Two-User Multiple-Access Channel

Publications associées (80)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

On communication over discrete memoryless channels with noiseless feedback

Peter Allan Berlin

The addition of a feedback link to a discrete memoryless channel does not increase its capacity, but it does bring with it other benefits. One of these benefits is an increase to the best achievable error exponent. In the first part of this thesis we revis ...

EPFL2008

Diversity embedding for broadband communication

Sanket Dusad

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 ...

EPFL2008

Concentration of Magnetization for Linear Block Codes

Nicolas Macris, Satish Babu Korada, Shrinivas Kudekar

We consider communication over the binary erasure and the binary additive white gaussian noise channels using fixed linear block codes and also appropriate ensembles of such codes. We show concentration of the magnetization over the channel realizations an ...

2008

Successive refinement for hypothesis testing and lossless one-helper problem

Jun Chen

We investigate two closely related successive refinement (SR) coding problems: 1) In the hypothesis testing (HT) problem, bivariate hypothesis H-o : P-XY against H-1 : P-X P-Y, i.e., test against independence is considered. One remote sensor collects data ...

2008

On Locating Byzantine Attackers

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

We examine networks that employ network coding, and are subject to Byzantine attacks. We consider systems where an appropriate network error correcting scheme is employed that is able to correct (up to a certain number of) Byzantine errors. Given this setu ...

2008

Delay and coding in multiple-user communications

Stéphane Musy

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 ...

EPFL2007

Distributed coding of multiresolution omnidirectional images

Pascal Frossard, Ivana Tosic, Vijayaraghavan Thirumalai

This paper addresses the problem of compact representation of a 3D scene, captured by distributed omnidirectional cameras. As the images from the sensors are likely to be correlated in most practical scenarios, we build a distributed algorithm based on cod ...

2007

Computation over multiple-access channels

Michael Christoph Gastpar

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 ...

2007

Computation over Multiple-access Channels

Michael Christoph Gastpar

Institute of Electrical and Electronics Engineers2007

On the Capacity of a Code Division Multiple Access System

Nicolas Macris, Satish Babu Korada

We consider multiuser communication on a binary input additive white Gaussian noise channel using Randomly Spread-Code Division Multiple Access. We show concentration of various quantities of the system including the capacity and the free energy. We also o ...

2007