Ruediger Urbanke

From MaRDI portal
Person:1949334

Available identifiers

zbMath Open urbanke.rudiger-lMaRDI QIDQ1949334

List of research outcomes





PublicationDate of PublicationType
The Stability of Low-Density Parity-Check Codes and Some of its Consequences2022-02-17Paper
Near-Optimal Finite-Length Scaling for Polar Codes Over Large Alphabets2020-01-28Paper
Displacement Convexity in Spatially Coupled Scalar Recursions2019-01-18Paper
Reed-Muller codes achieve capacity on erasure channels2017-09-29Paper
Reed–Muller Codes Achieve Capacity on Erasure Channels2017-09-21Paper
Finite-Length Scaling for Iteratively Decoded LDPC Ensembles2017-08-08Paper
The Generalized Area Theorem and Some of its Consequences2017-08-08Paper
Polar Codes: Characterization of Exponent, Bounds, and Constructions2017-07-27Paper
Polar Codes are Optimal for Lossy Source Coding2017-07-27Paper
Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC2017-07-27Paper
Exchange of Limits: Why Iterative Decoding Works2017-07-27Paper
Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation2017-06-08Paper
Windowed Decoding of Spatially Coupled Codes2017-06-08Paper
Iterative Coding for Network Coding2017-06-08Paper
Finite-Length Scaling for Polar Codes2017-05-16Paper
Linear Programming Decoding of Spatially Coupled Codes2017-05-16Paper
Spatial Coupling as a Proof Technique and Three Applications2017-04-28Paper
Wave-Like Solutions of General 1-D Spatially Coupled Systems2017-04-28Paper
Achieving Marton’s Region for Broadcast Channels Using Polar Codes2017-04-28Paper
A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes2017-04-28Paper
Error correcting codes and spatial coupling2016-07-29Paper
Threshold saturation in spatially coupled constraint satisfaction problems2013-05-07Paper
Turbo Codes in Binary Erasure Channel2009-02-24Paper
Maxwell Construction: The Hidden Bridge Between Iterative and Maximuma PosterioriDecoding2009-02-24Paper
Exact Thresholds and Optimal Codes for the Binary-Symmetric Channel and Gallager's Decoding Algorithm A2008-12-21Paper
Weight Distribution of Low-Density Parity-Check Codes2008-12-21Paper
Complexity Versus Performance of Capacity-Achieving Irregular Repeat–Accumulate Codes on the Binary Erasure Channel2008-12-21Paper
Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity2008-12-21Paper
On wide-band broadcast channels2008-12-21Paper
Parity-check density versus performance of binary linear block codes over memoryless symmetric channels2008-12-21Paper
Modern Coding Theory2008-06-05Paper
Fixed points and stability of density evolution2006-03-16Paper
Finite-length analysis of low-density parity-check codes on the binary erasure channel2005-05-11Paper
On the asymptotic input-output weight distributions and thresholds of convolutional and turbo-like encoders2005-05-11Paper
Systematic design of unitary space-time constellations2002-10-30Paper
https://portal.mardi4nfdi.de/entity/Q27765122002-10-21Paper
The capacity of low-density parity-check codes under message-passing decoding2002-08-04Paper
Design of capacity-approaching irregular low-density parity-check codes2002-08-04Paper
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation2002-08-04Paper
Efficient encoding of low-density parity-check codes2002-08-04Paper
Multiple-antenna signal constellations for fading channels2002-08-04Paper
Rate-splitting multiple access for discrete memoryless channels2002-08-04Paper
Lattice codes can achieve capacity on the AWGN channel1998-06-08Paper
Twist points of the von Koch snowflake1998-03-24Paper
An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms1997-04-13Paper
A rate-splitting approach to the Gaussian multiple-access channel1997-02-25Paper
A counterexample to a Voronoi region conjecture1997-01-30Paper
https://portal.mardi4nfdi.de/entity/Q48683311996-03-21Paper

Research outcomes over time

This page was built for person: Ruediger Urbanke