Recherche

Afficher tous les résultats pour

Accueil

Personne

Rüdiger Urbanke

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (84)

Page 3 sur 5

Polar Codes are Optimal for Lossy Source Coding

Rüdiger Urbanke

We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar codes achieve the capacity of arbitrary symmetric binary-input discrete mem ...

Institute of Electrical and Electronics Engineers2010

Spatial Coupling as a Proof Technique and Three Applications

Rüdiger Urbanke, Nicolas Macris, Andrei Giurgiu

The aim of this paper is to show that spatial coupling can be viewed not only as a means to build better graphical models, but also as a tool to better understand uncoupled models. The starting point is the observation that some asymptotic properties of gr ...

Ieee-Inst Electrical Electronics Engineers Inc2016

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

Analytic Determination of Scaling Parameters

Rüdiger Urbanke, Abdelaziz Amraoui

We show that the finite-length scaling parameters for irregular LDPC codes when used over the binary erasure channel can be computed without resorting to "covariance evolution''. We provide simple expressions that can be evaluated using solely the degree d ...

2006

The Generalized Area Theorem and Some of its Consequences

Rüdiger Urbanke, Cyril Measson

2009

Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation

Rüdiger Urbanke, Shrinivas Kudekar

We investigate spatially coupled code ensembles. For transmission over the binary erasure channel, it was recently shown that spatial coupling increases the belief propagation threshold of the ensemble to essentially the maximum a priori threshold of the u ...

Institute of Electrical and Electronics Engineers2013

Polar Codes Do Not Have Many Affine Automorphisms

Rüdiger Urbanke, Kirill Ivanov

Polar coding solutions demonstrate excellent performance under the list decoding that is challenging to implement in hardware due to the path sorting operations. As a potential solution to this problem, permutation decoding recently became a hot research t ...

IEEE2022

Polar Codes are Optimal for Lossy Source Coding

Rüdiger Urbanke

We consider lossy source compression of a binary symmetric source with Hamming distortion function. We show that polar codes combined with a low-complexity successive cancellation encoding algorithm achieve the rate-distortion bound. The complexity of both ...

2009

The Stability Condition of LDPC Codes Under MAP Decoding

Rüdiger Urbanke, Wei Liu

We determine the stability condition of low-density parity-check codes under both bitwise and blockwise maximum a posteriori decoding. As a consequence, we prove that the stability condition determines an upper bound on both the bitwise and the blockwise m ...

IEEE2018

Threshold Saturation in Spatially Coupled Constraint Satisfaction Problems

Rüdiger Urbanke, Nicolas Macris, Seyed Hamed Hassani

We consider chains of random constraint satisfaction models that are spatially coupled across a finite window along the chain direction. We investigate their phase diagram at zero temperature using the survey propagation formalism and the interpolation met ...

Springer Verlag2013

Constructing a provably adversarially-robust classifier from a high accuracy one

Rüdiger Urbanke, Grzegorz Adam Gluch

Modern machine learning models with very high accuracy have been shown to be vulnerable to small, adversarially chosen perturbations of the input. Given black-box access to a high-accuracy classifier f, we show how to construct a new classifier g that has ...

ADDISON-WESLEY PUBL CO2020

The Stability of Low-Density Parity-Check Codes and Some of its Consequences

Rüdiger Urbanke, Wei Liu

We study the stability of low-density parity-check codes under blockwise or bitwise maximum a posteriori decoding, where transmission takes place over a binary-input memoryless output-symmetric channel. Our study stems from the consideration of constructin ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Maximum a posteriori decoding and turbo codes for general memoryless channels

Rüdiger Urbanke, Cyril Measson

2005

A New Coding Paradigm for the Primitive Relay Channel

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

We present a coding paradigm that provides a new achievable rate for the primitive relay channel by combining compress-and-forward and decode-and-forward with a chaining construction. In the primitive relay channel model, the source broadcasts a message to ...

IEEE2018

Performance of Polar Codes for Channel and Source Coding

Rüdiger Urbanke

Polar codes, introduced recently by Arikan, are the first family of codes known to achieve capacity of symmetric channels using a low complexity successive cancellation decoder. Although these codes, combined with successive cancellation, are optimal in th ...

2009

Achieving Marton's Region for Broadcast Channels Using Polar Codes

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

We present polar coding schemes for the 2-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 up to date, and it is tight for all classes of 2-user ...

Ieee2014

Weight Distribution of Low-Density Parity-Check Codes

Rüdiger Urbanke, Changyan Di

We derive the average weight distribution function and its asymptotic growth rate for low-density parity-check (LDPC) code ensembles. We show that the growth rate of the minimum distance of LDPC codes depends only on the degree distribution pair. It turns ...

2006

Lower Bounds on the Rate-Distortion Function of Individual LDGM Codes

Rüdiger Urbanke, Shrinivas Kudekar

We consider lossy compression of a binary symmetric source by means of a low-density generator-matrix code. We derive two lower bounds on the rate distortion function which are valid for any low-density generator-matrix code with a given node degree distri ...

2008

Correction to “Multiple-Antenna Signal Constellations for Fading Channels”

Rüdiger Urbanke

2007

Capacity-achieving ensembles for the binary erasure channel with bounded complexity

Rüdiger Urbanke

2005