Publications associées à Canal binaire symétrique

Displacement Convexity - A Useful Framework for the Study of Spatially Coupled Codes

Rüdiger Urbanke, Nicolas Macris, Rafah El-Khatib

Spatial coupling has recently emerged as a powerful paradigm to construct graphical models that work well under low-complexity message-passing algorithms. Although much progress has been made on the analysis of spatially coupled models under message passin ...

Ieee2013

Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation

Rüdiger Urbanke, Shrinivas Kudekar

We investigate spatially coupled code ensembles. For transmission over the binary erasure channel, it was recently shown that spatial coupling increases the belief propagation threshold of the ensemble to essentially the maximum a priori threshold of the u ...

Institute of Electrical and Electronics Engineers2013

A Fast Hadamard Transform for Signals with Sub-linear Sparsity

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

A new iterative low complexity algorithm has been presented for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT, where N is a power of two and K = O(N^α), scales sub- linearly in N for some 0 < α < 1. Assuming a ...

2013

Growth Codes: Intermediate Performance Analysis and Application to Video

Pascal Frossard, Nikolaos Thomos, Rethnakaran Pulikkoonattu

Growth codes are a subclass of Rateless codes that have found interesting applications in data dissemination problems. Compared to other Rateless and conventional channel codes, Growth codes show improved intermediate performance which is particularly usef ...

Institute of Electrical and Electronics Engineers2013

Windowed Decoding of Spatially Coupled Codes

Rüdiger Urbanke

Spatially coupled codes have been of interest recently owing to their superior performance over memoryless binary-input channels. The performance is good both asymptotically, since the belief propagation thresholds approach the Shannon limit, as well as fo ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Securing Broadcast Against Dishonest Receivers

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

Consider a sender, Alice, who wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob and Calvin. In [1], we assumed that Bob and Calvin provide honest feedba ...

IEEE2013

Iterative Coding for Network Coding

Rüdiger Urbanke, Andrea Montanari

We consider communication over a noisy network under randomized linear network coding. Possible error mechanisms include node-or link-failures, Byzantine behavior of nodes, or an overestimate of the network min-cut. Building on the work of Kotter and Kschi ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Polar Codes For Broadcast Channels

Michael Christoph Gastpar, Emmanuel Abbé, Naveen Goela

Building on polar code constructions proposed by the authors for deterministic broadcast channels, two theorems are introduced in the present paper for noisy two-user broadcast channels. The theorems establish polar code constructions for two important ...

2013

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.

Canal binaire symétrique

On the Convergence Speed of Spatially Coupled LDPC Ensembles

Displacement Convexity - A Useful Framework for the Study of Spatially Coupled Codes

Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation

A Fast Hadamard Transform for Signals with Sub-linear Sparsity

Generalized Codes on Graphs and Applications in Content Distribution

Growth Codes: Intermediate Performance Analysis and Application to Video

Windowed Decoding of Spatially Coupled Codes

Securing Broadcast Against Dishonest Receivers

Iterative Coding for Network Coding

Polar Codes For Broadcast Channels

Graph Chatbot

Chattez avec Graph Search

On the Convergence Speed of Spatially Coupled LDPC Ensembles

Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation

Securing Broadcast Against Dishonest Receivers

Polar Codes For Broadcast Channels

Displacement Convexity - A Useful Framework for the Study of Spatially Coupled Codes

A Fast Hadamard Transform for Signals with Sub-linear Sparsity

Generalized Codes on Graphs and Applications in Content Distribution

Growth Codes: Intermediate Performance Analysis and Application to Video

Iterative Coding for Network Coding

Windowed Decoding of Spatially Coupled Codes