Publication

Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations

Publications associées (74)

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

Compressed network coding vectors

Christina Fragouli, Lorenzo Keller, Mahdi Jafari Siavoshani

In networks that employ network coding, two main approaches have been proposed in the literature to allow the receivers to recover the source information: (i) use of coding vectors, that keep track of the linear combinations the received packets contain, a ...

2009

Code Construction for Multiple Sources Network Coding

Christina Fragouli, Suhas Diggavi

In several wireless applications multiple sources transmit information to one or more receivers, many times over unknown topologies. This is especially so in mobile networks where learning the topology may have prohibitive complexity. Network coding techni ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2009

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

The Case for Structured Random Codes: Beyond Linear Models

Michael Christoph Gastpar

Recent work has shown that for some multi-user networks, carefully controlling the algebraic structure of the coding scheme may be just as useful as selecting the correct input distribution. In particular, for linear channel models, including finite field ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

Non-binary LDPC codes and EXIT like functions

In the first part of this thesis we are interested in the asymptotic performance analysis of Non-Binary Low-Density Parity-Check (NBLDPC) codes over the Binary Erasure Channel (BEC) decoded via the suboptimal Belief Propagation (BP) decoder as well as the ...

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

Structured random codes and sensor network coding theorems

Michael Christoph Gastpar

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 Usa2008

The case for structured random codes in network capacity theorems

Michael Christoph Gastpar

Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for proving some network capacity theorems: structured coding arguments, such as ran ...

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

Asymmetric multi-level diversity coding

Suhas Diggavi

Symmetric multilevel diversity coding was introduced by Roche et al, where a set of K information sources is encoded by K encoders and the decoders reconstruct sources 1, . . . , k, where k is the number of encoders to which they have access. In this paper ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2008