Publications related to A New Coding Paradigm for the Primitive Relay Channel

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.

Approximate Decoding for Network Coded Inter-dependent Data

Pascal Frossard, Nikolaos Thomos, Hyung Gon Park

In this paper, we consider decoding of loss tolerant data encoded by network coding and transmitted over error-prone networks. Intermediate network nodes typically perform the random linear network coding in a Galois field and a Gaussian elimination is use ...

Elsevier Science Bv2016

Multidrop data transfer

Mohammad Amin Shokrollahi, Ali Hormati

Multi-drop communications channels can have significantly deep notches in their frequency response causing a corresponding limitation of the effective data transmission rate. A special time-ordered coding method is described which results in the emitted sp ...

2016

Approaching the Rate-Distortion Limit With Spatial Coupling, Belief Propagation, and Decimation

Nicolas Macris, Vahid Aref, Marc Vuffray

We investigate an encoding scheme for lossy compression of a binary symmetric source based on simple spatially coupled low-density generator-matrix codes. The degree of the check nodes is regular and the one of code-bits is Poisson distributed with an aver ...

Institute of Electrical and Electronics Engineers2015

A joint typicality approach to compute-forward

Michael Christoph Gastpar, Sung Hoon Lim, Chen Feng

A general framework for analyzing linear codes with joint typicality encoders and decoders is presented. Using this approach, we provide a new perspective on the compute-forward framework. In particular, an achievable rate region for computing the weighted ...

2015

Achieving Marton's Region for Broadcast Channels Using Polar Codes

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

This paper presents polar coding schemes for the two-user discrete memoryless broadcast channel (DM-BC) which achieve Marton's region with both common and private messages. This is the best achievable rate region known to date, and it is tight for all clas ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Hardware Architecture for List Successive Cancellation Decoding of Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming

This brief presents a hardware architecture and algorithmic improvements for list successive cancellation (SC) decoding of polar codes. More specifically, we show how to completely avoid copying of the likelihoods, which is algorithmically the most cumbers ...

Institute of Electrical and Electronics Engineers2014

Successive Refinement of Gaussian Projections

Michael Christoph Gastpar, Guillaume Jean Op 't Veld

Successive refinement is a technique to encode a source iteratively, improving the distortion at each step. If the code rates of all steps combined can be as efficient as coding only for the final distortion in one go, then the source is said to be success ...

2014

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

A New Coding Paradigm for the Primitive Relay Channel

Graph Chatbot

Chat with Graph Search

Approximate Decoding for Network Coded Inter-dependent Data

Multidrop data transfer

Re-proving Channel Polarization Theorems

Approaching the Rate-Distortion Limit With Spatial Coupling, Belief Propagation, and Decimation

A joint typicality approach to compute-forward

Achieving Marton's Region for Broadcast Channels Using Polar Codes

Hardware Architecture for List Successive Cancellation Decoding of Polar Codes

Successive Refinement of Gaussian Projections

Polar Codes for the Two-User Multiple-Access Channel

Rate allocation and optimized decoding in inter-session network coding

Multidrop data transfer

Rate allocation and optimized decoding in inter-session network coding

A joint typicality approach to compute-forward

Approaching the Rate-Distortion Limit With Spatial Coupling, Belief Propagation, and Decimation

Approximate Decoding for Network Coded Inter-dependent Data

Re-proving Channel Polarization Theorems

Achieving Marton's Region for Broadcast Channels Using Polar Codes

Hardware Architecture for List Successive Cancellation Decoding of Polar Codes

Successive Refinement of Gaussian Projections

Polar Codes for the Two-User Multiple-Access Channel