Rüdiger L. Urbanke

Affiliations:
  • Swiss Federal Institute of Technology in Lausanne, Switzerland


According to our database1, Rüdiger L. Urbanke authored at least 139 papers between 1994 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Bayes Complexity of Learners vs Overfitting.
CoRR, 2023

Breaking a Classical Barrier for Classifying Arbitrary Test Examples in the Quantum Model.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
On the Efficiency of Polar-Like Decoding for Symmetric Codes.
IEEE Trans. Commun., 2022

Polar Codes Do Not Have Many Affine Automorphisms.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
The Stability of Low-Density Parity-Check Codes and Some of its Consequences.
IEEE Trans. Inf. Theory, 2021

Provable Adversarial Robustness in the Quantum Model.
CoRR, 2021

Device-Independent Quantum Key Distribution.
CoRR, 2021

Noether: The More Things Change, the More Stay the Same.
CoRR, 2021

Adversarial Robustness: What fools you makes you stronger.
CoRR, 2021

Exponential Separation between Two Learning Models and Adversarial Robustness.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Query Complexity of Adversarial Attacks.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Capacity-achieving codes: a review on double transitivity.
CoRR, 2020

Partially symmetric monomial codes.
CoRR, 2020

On the dependency between the code symmetries and the decoding efficiency.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

On the Universality of Low-Density Parity-Check Block Codes.
Proceedings of the 54th Annual Conference on Information Sciences and Systems, 2020

Constructing a provably adversarially-robust classifier from a high accuracy one.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Near-Optimal Finite-Length Scaling for Polar Codes Over Large Alphabets.
IEEE Trans. Inf. Theory, 2019

Construction of Polar Codes With Sublinear Complexity.
IEEE Trans. Inf. Theory, 2019

Displacement Convexity in Spatially Coupled Scalar Recursions.
IEEE Trans. Inf. Theory, 2019

A New Coding Paradigm for the Primitive Relay Channel.
Algorithms, 2019

Improved decoding of second-order Reed-Muller codes.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
How to Achieve the Capacity of Asymmetric Channels.
IEEE Trans. Inf. Theory, 2018

Decoder Partitioning: Towards Practical List Decoding of Polar Codes.
IEEE Trans. Commun., 2018

Coding Theory for Inference, Learning and Optimization (Dagstuhl Seminar 18112).
Dagstuhl Reports, 2018

The Stability Condition of LDPC Codes Under MAP Decoding.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Reed-Muller Codes Achieve Capacity on Erasure Channels.
IEEE Trans. Inf. Theory, 2017

Time-invariant LDPC convolutional codes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Partitioned List Decoding of Polar Codes: Analysis and Improvement of Finite Length Performance.
Proceedings of the 2017 IEEE Global Communications Conference, 2017

2016
Unified Scaling of Polar Codes: Error Exponent, Scaling Exponent, Moderate Deviations, and Error Floors.
IEEE Trans. Inf. Theory, 2016

Spatial Coupling as a Proof Technique and Three Applications.
IEEE Trans. Inf. Theory, 2016

Guest Editorial Recent Advances in Capacity Approaching Codes.
IEEE J. Sel. Areas Commun., 2016

Bounds for Random Constraint Satisfaction Problems via Spatial Coupling.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Comparing the bit-MAP and block-MAP decoding thresholds of reed-muller codes on BMS channels.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes.
IEEE Trans. Inf. Theory, 2015

Scaling Exponent of List Decoders With Applications to Polar Codes.
IEEE Trans. Inf. Theory, 2015

Achieving Marton's Region for Broadcast Channels Using Polar Codes.
IEEE Trans. Inf. Theory, 2015

Wave-Like Solutions of General 1-D Spatially Coupled Systems.
IEEE Trans. Inf. Theory, 2015

Reed-Muller Codes Achieve Capacity on the Binary Erasure Channel under MAP Decoding.
CoRR, 2015

2014
Finite-Length Scaling for Polar Codes.
IEEE Trans. Inf. Theory, 2014

Linear Programming Decoding of Spatially Coupled Codes.
IEEE Trans. Inf. Theory, 2014

From Polar to Reed-Muller Codes: A Technique to Improve the Finite-Length Performance.
IEEE Trans. Commun., 2014

Achieving the Superposition and Binning Regions for Broadcast Channels Using Polar Codes.
CoRR, 2014

Error correcting codes and spatial coupling.
CoRR, 2014

Physics-inspired methods for networking and communications.
IEEE Commun. Mag., 2014

Universal polar codes.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Analysis of coupled scalar systems by displacement convexity.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Iterative Coding for Network Coding.
IEEE Trans. Inf. Theory, 2013

Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation.
IEEE Trans. Inf. Theory, 2013

Windowed Decoding of Spatially Coupled Codes.
IEEE Trans. Inf. Theory, 2013

Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization.
IEEE Trans. Inf. Theory, 2013

Spatial Coupling as a Proof Technique
CoRR, 2013

Transmission of 130-Gb/s PDM-QPSK over 5, 760-km with co-propagating 10-Gb/s OOK channels in dispersion-managed NZDSF spans with soft-decision LDPCC coding.
Proceedings of the 2013 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference (OFC/NFOEC), 2013

A closed-form scaling law for convolutional LDPC codes over the BEC.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

The least degraded and the least upgraded channel with respect to a channel family.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Displacement convexity - A useful framework for the study of spatially coupled codes.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

The space of solutions of coupled XORSAT formulae.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

And now to something completely different: Spatial coupling as a proof technique.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Wave-Like Solutions of General One-Dimensional Spatially Coupled Systems
CoRR, 2012

Polar codes: Robustness of the successive cancellation decoder with respect to quantization.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Universal bounds on the scaling behavior of polar codes.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

How to prove the Maxwell conjecture via spatial coupling - A proof of concept.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Lossy source coding via spatially coupled LDGM ensembles.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC.
IEEE Trans. Inf. Theory, 2011

Exchange of Limits: Why Iterative Decoding Works.
IEEE Trans. Inf. Theory, 2011

Threshold Saturation in Spatially Coupled Constraint Satisfaction Problems
CoRR, 2011

Chains of Mean Field Models
CoRR, 2011

Reliability of Clustered vs. Declustered Replica Placement in Data Storage Systems.
Proceedings of the MASCOTS 2011, 2011

Existence and uniqueness of GEXIT curves via the Wasserstein metric.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Universal rateless codes from coupled LT codes.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Rate-equivocation optimal spatially coupled LDPC codes for the BEC wiretap channel.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Scaling behavior of convolutional LDPC ensembles over the BEC.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

A mobile world of security - The model.
Proceedings of the 45st Annual Conference on Information Sciences and Systems, 2011

2010
Polar codes are optimal for lossy source coding.
IEEE Trans. Inf. Theory, 2010

Polar Codes: Characterization of Exponent, Bounds, and Constructions.
IEEE Trans. Inf. Theory, 2010

Threshold Saturation on BMS Channels via Spatial Coupling
CoRR, 2010

Coupled graphical models and their thresholds.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

An empirical scaling law for polar codes.
Proceedings of the IEEE International Symposium on Information Theory, 2010

On the scaling of polar codes: I. The behavior of polarized channels.
Proceedings of the IEEE International Symposium on Information Theory, 2010

On the scaling of polar codes: II. The behavior of un-polarized channels.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
The generalized area theorem and some of its consequences.
IEEE Trans. Inf. Theory, 2009

Finite-Length Scaling for Iteratively Decoded LDPC Ensembles.
IEEE Trans. Inf. Theory, 2009

Polar Codes for Channel and Source Coding
CoRR, 2009

Waterfall region performance of punctured LDPC codes over the BEC.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Performance of polar codes for channel and source coding.
Proceedings of the IEEE International Symposium on Information Theory, 2009

The compound capacity of polar codes.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008
Maxwell Construction: The Hidden Bridge Between Iterative and Maximum a Posteriori Decoding.
IEEE Trans. Inf. Theory, 2008

Turbo Codes in Binary Erasure Channel.
IEEE Trans. Inf. Theory, 2008

New directions in information theory.
Eur. Trans. Telecommun., 2008

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

Computing the threshold shift for general channels.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

The slope scaling parameter for general channels, decoders, and ensembles.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Modern Coding Theory.
Cambridge University Press, ISBN: 9780511791338, 2008

2007
Correction to "Multiple-Antenna Signal Constellations for Fading Channels".
IEEE Trans. Inf. Theory, 2007

On the performance of turbo codes over the binary erasure channel.
IEEE Commun. Lett., 2007

How to find good finite-length codes: from art towards science.
Eur. Trans. Telecommun., 2007

Coding for Network Coding
CoRR, 2007

Degree Optimization and Stability Condition for the Min-Sum Decoder
CoRR, 2007

Modern Coding Theory: The Statistical Mechanics and Computer Science Point of View
CoRR, 2007

Existence Proofs of Some EXIT Like Functions.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Asymptotic Rate versus Design Rate.
Proceedings of the IEEE International Symposium on Information Theory, 2007

A Generalization of the Finite-Length Scaling Approach Beyond the BEC.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Weight Distribution of Low-Density Parity-Check Codes.
IEEE Trans. Inf. Theory, 2006

Analytic Determination of Scaling Parameters.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Capacity-achieving ensembles for the binary erasure channel with bounded complexity.
IEEE Trans. Inf. Theory, 2005

Density Evolution, Thresholds and the Stability Condition for Non-binary LDPC Codes
CoRR, 2005

Why We Can Not Surpass Capacity: The Matching Condition
CoRR, 2005

Finite-length scaling of irregular LDPC code ensembles.
Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

Maximum a posteriori decoding and turbo codes for general memoryless channels.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Complexity Versus Performance of Capacity-Achieving Irregular Repeat-Accumulate Codes on the Binary Erasure Channel.
IEEE Trans. Inf. Theory, 2004

Exact Thresholds and Optimal Codes for the Binary-Symmetric Channel and Gallager's Decoding Algorithm A.
IEEE Trans. Inf. Theory, 2004

Life Above Threshold: From List Decoding to Area Theorem and MSE
CoRR, 2004

Finite-Length Scaling and Finite-Length Shift for Low-Density Parity-Check Codes
CoRR, 2004

Bounds on the decoding complexity of punctured codes on graphs
CoRR, 2004

Fixed Points and Stability of Density Evolution.
Commun. Inf. Syst., 2004

Maxwell's construction: the hidden bridge between maximum-likelihood and iterative decoding.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Weight distributions of LDPC code ensembles: combinatorics meets statistical physics.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Further results on finite-length scaling for iteratively decoded LDPC ensembles.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Parity-check density versus performance of binary linear block codes over memorylesssymmetric channels.
IEEE Trans. Inf. Theory, 2003

On wide-band broadcast channels.
IEEE Trans. Inf. Theory, 2003

The renaissance of Gallager's low-density parity-check codes.
IEEE Commun. Mag., 2003

2002
On the asymptotic input-output weight distributions and thresholds of convolutionaland turbo-like encoders.
IEEE Trans. Inf. Theory, 2002

Finite-length analysis of low-density parity-check codes on the binary erasure channel.
IEEE Trans. Inf. Theory, 2002

2001
Efficient encoding of low-density parity-check codes.
IEEE Trans. Inf. Theory, 2001

The capacity of low-density parity-check codes under message-passing decoding.
IEEE Trans. Inf. Theory, 2001

Design of capacity-approaching irregular low-density parity-check codes.
IEEE Trans. Inf. Theory, 2001

Rate-splitting multiple access for discrete memoryless channels.
IEEE Trans. Inf. Theory, 2001

Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation.
IEEE Trans. Inf. Theory, 2001

Multiple-antenna signal constellations for fading channels.
IEEE Trans. Inf. Theory, 2001

On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit.
IEEE Commun. Lett., 2001

2000
Systematic design of unitary space-time constellations.
IEEE Trans. Inf. Theory, 2000

1999
Efficient implementation of parallel decision feedback decoders for broadband applications.
Proceedings of the 6th IEEE International Conference on Electronics, Circuits and Systems, 1999

1998
Lattice Codes Can Achieve Capacity on the AWGN Channel.
IEEE Trans. Inf. Theory, 1998

1996
A rate-splitting approach to the Gaussian multiple-access channel.
IEEE Trans. Inf. Theory, 1996

1995
A counterexample to a Voronoi region conjecture.
IEEE Trans. Inf. Theory, 1995

Smoothed pseudo-Wigner distribution, Choi-Williams distribution, and cone-kernel representation: Ambiguity-domain analysis and experimental comparison.
Signal Process., 1995

An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms.
Exp. Math., 1995

1994
Bilinear time-frequency representations of signals: the shift-scale invariant class.
IEEE Trans. Signal Process., 1994


  Loading...