Publications related to Polarization Theorems for Arbitrary DMCs

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.

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

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

LLR-Based Successive Cancellation List Decoding of Polar Codes

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming

We show that successive cancellation list decoding can be formulated exclusively using log-likelihood ratios. In addition to numerical stability, the log-likelihood ratio based formulation has useful properties that simplify the sorting step involved in su ...

Institute of Electrical and Electronics Engineers2015

A Counter-Example to the Mismatched Decoding Converse for Binary-Input Discrete Memoryless Channels

Jonathan Mark Scarlett, Albert Guillén i Fàbregas

This paper studies the mismatched decoding problem for binary-input discrete memoryless channels. An example is provided for which an achievable rate based on superposition coding exceeds the Csiszar-Korner-Hui rate, thus providing a counter-example to a p ...

Institute of Electrical and Electronics Engineers2015

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

Finite-Length Scaling for Polar Codes

Rüdiger Urbanke, Seyed Hamed Hassani

Consider a binary-input memoryless output-symmetric channel W. Such a channel has a capacity, call it I (W), and for any R < I (W) and strictly positive constant P-e we know that we can construct a coding scheme that allows transmission at rate R with an e ...

Ieee-Inst Electrical Electronics Engineers Inc2014

From Polar to Reed-Muller Codes: a Technique to Improve the Finite-Length Performance

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

We explore the relationship between polar and RM codes and we describe a coding scheme which improves upon the performance of the standard polar code at practical block lengths. Our starting point is the experimental observation that RM codes have a smalle ...

2014

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

Polarization Theorems for Arbitrary DMCs

Graph Chatbot

Chat with Graph Search

Re-proving Channel Polarization Theorems

Polar Codes for Broadcast Channels

Achieving Marton's Region for Broadcast Channels Using Polar Codes

LLR-Based Successive Cancellation List Decoding of Polar Codes

A Counter-Example to the Mismatched Decoding Converse for Binary-Input Discrete Memoryless Channels

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

Finite-Length Scaling for Polar Codes

From Polar to Reed-Muller Codes: a Technique to Improve the Finite-Length Performance

Polar coding for arbitrary DMCs

Polar Codes For Broadcast Channels

Re-proving Channel Polarization Theorems

Polar Codes for Broadcast Channels

Achieving Marton's Region for Broadcast Channels Using Polar Codes

Finite-Length Scaling for Polar Codes

LLR-Based Successive Cancellation List Decoding of Polar Codes

A Counter-Example to the Mismatched Decoding Converse for Binary-Input Discrete Memoryless Channels

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

From Polar to Reed-Muller Codes: a Technique to Improve the Finite-Length Performance

Polar coding for arbitrary DMCs

Polar Codes For Broadcast Channels