Publications related to Scaling Exponent of List Decoders with Applications to Polar Codes

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 Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes

Rüdiger Urbanke

Spatially-coupled low-density parity-check (SC-LDPC) codes are known to have excellent asymptotic properties. Much less is known regarding their finite-length performance. We propose a scaling law to predict the error probability of finite-length spatially ...

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

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

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

Linear Programming Decoding of Spatially Coupled Codes

Rüdiger Urbanke, Badih Ghazi

For a given family of spatially coupled codes, we prove that the linear programming (LP) threshold on the binary-symmetric channel (BSC) of the tail-biting graph cover ensemble is the same as the LP threshold on the BSC of the derived spatially coupled ens ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Extremal Channels of Gallager's E-0 Under the Basic Polarization Transformations

Mine Alsan

We study the extremality of the binary erasure channel and the binary symmetric channel for Gallager's reliability function E-0 of binary input discrete memoryless channels evaluated under the uniform input distribution from the aspect of channel polarizat ...

Institute of Electrical and Electronics Engineers2014

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

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

Scaling Exponent of List Decoders with Applications to Polar Codes

Graph Chatbot

Chat with Graph Search

Re-proving Channel Polarization Theorems

A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes

Achieving Marton's Region for Broadcast Channels Using Polar Codes

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

Finite-Length Scaling for Polar Codes

Linear Programming Decoding of Spatially Coupled Codes

Extremal Channels of Gallager's E-0 Under the Basic Polarization Transformations

Compute-and-forward for discrete memoryless networks

Is non-unique decoding necessary?

Windowed Decoding of Spatially Coupled Codes

Re-proving Channel Polarization Theorems

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

Finite-Length Scaling for Polar Codes

Linear Programming Decoding of Spatially Coupled Codes

Is non-unique decoding necessary?

A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes

Windowed Decoding of Spatially Coupled Codes

Compute-and-forward for discrete memoryless networks

Extremal Channels of Gallager's E-0 Under the Basic Polarization Transformations

Achieving Marton's Region for Broadcast Channels Using Polar Codes