Publications related to On communication over discrete memoryless channels with noiseless feedback

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.

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

Polar Codes for Broadcast Channels

Michael Christoph Gastpar, Emmanuel Abbé, Naveen Goela

Polar codes are introduced for discrete memoryless broadcast channels. For m-user deterministic broadcast channels, polarization is applied to map uniformly random message bits from m-independent messages to one codeword while satisfying broadcast constrai ...

Institute of Electrical and Electronics Engineers2015

Secure Network Coding With Erasures and Feedback

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

Secure network coding assumes that the underlying network channels are error-free; thus, if our channels introduce errors, we need to first apply a channel code to correct them, and then build security on top of the resulting error-free network. In this pa ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Scaling Exponent of List Decoders With Applications to Polar Codes

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

Motivated by the significant performance gains which polar codes experience under successive cancellation list decoding, their scaling exponent is studied as a function of the list size. In particular, the error probability is fixed, and the tradeoff betwe ...

Ieee-Inst Electrical Electronics Engineers Inc2015

On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding

Jonathan Mark Scarlett

This paper studies the second-order coding rates for memoryless channels with a state sequence known non-causally at the encoder. In the case of finite alphabets, an achievability result is obtained using constant-composition random coding, and by using a ...

Institute of Electrical and Electronics Engineers2015

Asynchronous Decoding of LDPC Codes over BEC

Amin Karbasi, Amir Hesam Salavati, Saeid Haghighatshoar

LDPC codes are typically decoded by running a synchronous message passing algorithm over the corresponding bipartite factor graph (made of variable and check nodes). More specifically, each synchronous round consists of 1) updating all variable nodes based ...

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

Second-order asymptotics for the Gaussian MAC with degraded message sets

Jonathan Mark Scarlett

This paper studies the second-order asymptotics of the Gaussian multiple-access channel with degraded message sets. For a fixed average error probability epsilon is an element of (0, 1) and an arbitrary point on the boundary of the capacity region, we char ...

Institute of Electrical and Electronics Engineers2015

On communication over discrete memoryless channels with noiseless feedback

Graph Chatbot

Chat with Graph Search

Sparse Probabilistic Models

A joint typicality approach to compute-forward

Polar Codes for Broadcast Channels

Secure Network Coding With Erasures and Feedback

Scaling Exponent of List Decoders With Applications to Polar Codes

On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding

Asynchronous Decoding of LDPC Codes over BEC

Achieving Marton's Region for Broadcast Channels Using Polar Codes

Non-malleable Reductions and Applications

Second-order asymptotics for the Gaussian MAC with degraded message sets

Sparse Probabilistic Models

On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding

Polar Codes for Broadcast Channels

Achieving Marton's Region for Broadcast Channels Using Polar Codes

Asynchronous Decoding of LDPC Codes over BEC

Second-order asymptotics for the Gaussian MAC with degraded message sets

Scaling Exponent of List Decoders With Applications to Polar Codes

Non-malleable Reductions and Applications

A joint typicality approach to compute-forward

Secure Network Coding With Erasures and Feedback