Publication

The Least Degraded and the Least Upgraded Channel with respect to a Channel Family

Publications associées (6)

On the Efficiency of Polar-Like Decoding for Symmetric Codes

The recently introduced polar codes constitute a breakthrough in coding theory due to their capacity-achieving property. This goes hand in hand with a quasilinear construction, encoding, and successive cancellation list decoding procedures based on the Plo ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

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 when they are decoded with successive cancellation list decoders, we study how the scaling exponent changes as a function of the list size L. In particular, we fix the block error ...

Ieee2013

Approximate Capacity of the Dirty Multiple-Access Channel With Partial State Information at the Encoders

I-Hsiang Wang

In this paper, we consider the K-user Gaussian multiple-access channel with multiple independent additive white Gaussian interferences. Each interference is known to exactly one transmitter non-causally. The capacity region is characterized to within a bou ...

Institute of Electrical and Electronics Engineers2012

Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC

Rüdiger Urbanke, Shrinivas Kudekar

Convolutional low-density parity-check (LDPC) ensembles, introduced by Felstrom and Zigangirov, have excellent thresholds and these thresholds are rapidly increasing functions of the average degree. Several variations on the basic theme have been proposed ...

2011

Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC

Rüdiger Urbanke, Shrinivas Kudekar

Convolutional LDPC ensembles, introduced by Felstrom and Zigangirov, have excellent thresholds and these thresholds are rapidly increasing as a function of the average degree. Several variations on the basic theme have been proposed to date, all of which s ...

IEEE2010

Capacity Achieving Codes from Randomness Conductors

Mahdi Cheraghchi Bashi Astaneh

We give a general framework for construction of small ensembles of capacity achieving linear codes for a wide range of (not necessarily memoryless) discrete symmetric channels, and in particular, the binary erasure and symmetric channels. The main tool use ...

2009