Concept

Noisy-channel coding theorem

Related publications (317)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Optimized MVC Prediction Structures for Interactive Multiview Video Streaming

Pascal Frossard, Ana Karina De Abreu Goes

The Multiview Video Coding (MVC) standard efficiently compresses multiview video by considering spatial, temporal and interview correlations. This letter studies the impact of the MVC interview prediction structure on both the transmission and the overall ...

Ieee-Inst Electrical Electronics Engineers Inc2013

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

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 coding for arbitrary DMCs

Emre Telatar, Rajai Nasser

Polar codes are constructed for arbitrary channels by imposing an arbitrary quasigroup structure on the input alphabet. The block error probability under successive cancellation decoding decays exponentially with the square root of the block length. It is ...

2013

Cellular Adaptation Facilitates Sparse and Reliable Coding in Sensory Pathways

Eilif Benjamin Muller

Most neurons in peripheral sensory pathways initially respond vigorously when a preferred stimulus is presented, but adapt as stimulation continues. It is unclear how this phenomenon affects stimulus coding in the later stages of sensory processing. Here, ...

Public Library Science2013

Iterative Learning and Denoising in Convolutional Neural Associative Memories

Mohammad Amin Shokrollahi, Amin Karbasi, Amir Hesam Salavati

The task of a neural associative memory is to retrieve a set of previously memorized pat- terns from their noisy versions by using a net- work of neurons. Hence, an ideal network should be able to 1) gradually learn a set of patterns, 2) retrieve the corre ...

2013

Contact properties of high-mobility, air-stable, low-voltage organic n-channel thin-film transistors based on a naphthalene tetracarboxylic diimide

Klaus Kern, Hagen Klauk

Air-stable bottom-gate, top-contact n-channel organic transistors based on a naphthalene diimide exhibiting electron mobilities up to 0.8 cm(2)/Vs at low voltages were fabricated. Transistors with channel lengths of 1 mu m show a transconductance of 60 mS/ ...

Amer Inst Physics2013

Interactive Function Computation

Michael Christoph Gastpar

We investigate the role of interaction for computa- tion problem settings where nodes intend to compute functions of the raw messages generated at other nodes. In this work, we make some progress on a more elementary research component: feedback. Specifica ...

2013

A Low-Complexity Practical Quantize-and-Forward Scheme for Two-hop Relay Systems

We study a low-complexity practical quantize-and-forward (QF) scheme, a special case of the compress-and-forward (CF) transmission for half-duplex relay systems. By adjusting the number of quantization levels, we show that significant performance improveme ...

Ieee2012

Layered Detection and Decoding in MIMO Wireless Systems

Andreas Peter Burg, Nicholas Alexander Preyss, Christoph Studer

Iterative detection and decoding (IDD) in multiple-input multiple-output (MIMO) wireless systems is known to achieve near channel capacity. The high computational complexity of IDD, however, poses signiﬁcant challenges for practical implementations (in ter ...

2012