Publication

A Characterization of the Shannon Ordering of Communication Channels

Publications associées (34)

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

A Class of Transformations that Polarize Binary-Input Memory less Channels

Satish Babu Korada, Eren Sasoglu

A generalization of Arikan's polar code construction using transformations of the form G(circle times n) where G is an l x l matrix is considered. Necessary and sufficient conditions are given for these transformations to ensure channel polarization. It is ...

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

Network-Coded Broadcast: from Canonical Networks to Random Topologies

Christina Fragouli, Jörg Widmer

We consider the problem of finding the minimum number of transmissions in an ad-hoc network for all-to-all broadcasting using network coding. This work generalizes previous results for canonical topologies such as the circle and the wrap around grid to the ...

2008

Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

This paper provides new results on computing simultaneous sparse approximations of multichannel signals over redundant dictionaries using two greedy algorithms. The first one, p-thresholding, selects the S atoms that have the largest

p

-correlation while ...

2008

Rateless coding with partial CSI at the decoder

Michael Christoph Gastpar

A channel model for channels with unknown state and partial state information available causally at the decoder is proposed. The model is based on arbitrarily varying channels (AVCs), and the partial state information is characterized by allowing the decod ...

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

Broadcast, relay and feedback in Gaussian channels

Sibi Raj Bhaskaran Pillai

Network information theory explores the fundamental data transport limits over communication networks. Broadcasting and relaying are two natural models arising in communication contexts where multiple users share a common communication medium. Number of re ...

EPFL2007

Variable length coding over an unknown channel

Emre Telatar, Aslan Tchamkerten

Burnashev in 1976 gave an exact expression for the reliability function of a discrete memoryless channel (DMC) with noiseless feedback. A coding scheme that achieves this exponent needs, in general, to know the statistics of the channel. Suppose now that t ...

2006

Mechanical control of fluids in micro-analytical devices

Hubert Girault, Joël Rossier, Xiaoxia Bai

An apparatus for manipulating fluid samples comprises a micro-chip device having first and second covered channels, each channel having openings at both ends. The channels intersect to form a common intersection. Three of the openings of the channels are c ...

2006

Feedback communication over unknown channels

Aslan Tchamkerten

Suppose Q is a family of discrete memoryless channels. An unknown member of Q will be available, with perfect, causal output feedback for communication. Is there a coding scheme (possibly with variable transmission time) that can achieve the Burnashev erro ...

EPFL2005

On the universality of Burnashev's error exponent

Emre Telatar, Aslan Tchamkerten

We consider communication over a time invariant discrete memoryless channel with noiseless and instantaneous feedback. We assume that the communicating parties are not aware of the underlying channel, however they know that it belongs to some specific fami ...

2005

On Network Correlated Data Gathering

Martin Vetterli, Razvan Cristescu

We consider the problem of correlated data gathering by a network with a sink node and a tree communication structure, where the goal is to minimize the total transmission cost of transporting the information collected by the nodes, to the sink node. Two c ...

2004

Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

p

-correlation while ...

2008