Publication

Concatenated codes for block-fading channels

Related publications (305)

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.

Is non-unique decoding necessary?

Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

In multi-terminal communication systems, signals carrying messages meant for different destinations are often observed together at any given destination receiver. Han and Kobayashi (1981) proposed a receiving strategy which performs a joint unique decoding ...

Institute of Electrical and Electronics Engineers2014

Rate allocation and optimized decoding in inter-session network coding

Eirina Bourtsoulatze

Recent advances in data processing and communication systems have led to a continuous increase in the amount of data communicated over today’s networks. These large volumes of data pose new challenges on the current networking infrastructure that only offe ...

EPFL2013

Generalized Codes on Graphs and Applications in Content Distribution

Masoud Alipour Babaei

The contribution of this thesis is twofold. In the first part, we generalize and analyze two classes of error correcting codes: LDPC codes and product codes. We generalize graphical codes by considering checks being arbitrary codes instead of single pariti ...

EPFL2013

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

Polar Codes for the Two-User Multiple-Access Channel

Emre Telatar, Eren Sasoglu

Arikan's polar coding method is extended to two-user multiple-access channels. It is shown that if the two users of the channel use Arikan's construction, the resulting channels will polarize to one of five possible extremals, on each of which uncoded tran ...

Institute of Electrical and Electronics Engineers2013

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

Polarization and Spatial Coupling

Seyed Hamed Hassani

During the last two decades we have witnessed considerable activity in building bridges between the fields of information theory/communications, computer science, and statistical physics. This is due to the realization that many fundamental concepts and no ...

EPFL2013

Approximate Decoding Approaches for Network Coded Correlated Data

Pascal Frossard, Nikolaos Thomos, Hyung Gon Park

This paper considers a framework where data from correlated sources are transmitted with help of network coding in ad-hoc network topologies. The correlated data are encoded independently at sensors and network coding is employed in the intermediate nodes ...

Institute of Electrical and Electronics Engineers2013

Polarization Theorems for Arbitrary DMCs

Emre Telatar, Rajai Nasser

A polarization phenomenon in a special sense is shown for an arbitrary discrete memoryless channel (DMC) by imposing a quasigroup structure on the input alphabet. The same technique is used to derive a polarization theorem for an arbitrary multiple access ...

IEEE2013

Cooperative Relaying at Finite SNR–-Role of Quantize-Map-and-Forward

Christina Fragouli, Ayan Sengupta, I-Hsiang Wang

Quantize-Map-and-Forward (QMF) relaying has been shown to achieve the optimal diversity-multiplexing trade-off (DMT) for arbitrary slow fading full-duplex networks as well as for the single-relay half-duplex network. A key reason for the DMT-optimality of ...

2013