Search the dblp DataBase
Rüdiger L. Urbanke :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Abdelaziz Amraoui , Andrea Montanari , Thomas J. Richardson , Rüdiger L. Urbanke Finite-Length Scaling for Iteratively Decoded LDPC Ensembles [Citation Graph (0, 0)][DBLP ] CoRR, 2004, v:0, n:, pp:- [Journal ] Henry D. Pfister , Igal Sason , Rüdiger L. Urbanke Capacity-achieving ensembles for the binary erasure channel with bounded complexity [Citation Graph (0, 0)][DBLP ] CoRR, 2004, v:0, n:, pp:- [Journal ] Henry D. Pfister , Igal Sason , Rüdiger L. Urbanke Bounds on the decoding complexity of punctured codes on graphs [Citation Graph (0, 0)][DBLP ] CoRR, 2004, v:0, n:, pp:- [Journal ] Abdelaziz Amraoui , Andrea Montanari , Thomas J. Richardson , Rüdiger L. Urbanke Finite-Length Scaling and Finite-Length Shift for Low-Density Parity-Check Codes [Citation Graph (0, 0)][DBLP ] CoRR, 2004, v:0, n:, pp:- [Journal ] Cyril Measson , Andrea Montanari , Thomas J. Richardson , Rüdiger L. Urbanke Life Above Threshold: From List Decoding to Area Theorem and MSE [Citation Graph (0, 0)][DBLP ] CoRR, 2004, v:0, n:, pp:- [Journal ] Dakshi Agrawal , Thomas J. Richardson , Rüdiger L. Urbanke Multiple-antenna signal constellations for fading channels. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2001, v:47, n:6, pp:2618-2626 [Journal ] Louay Bazzi , Thomas J. Richardson , Rüdiger L. Urbanke Exact Thresholds and Optimal Codes for the Binary-Symmetric Channel and Gallager's Decoding Algorithm A. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2004, v:50, n:9, pp:2010-2021 [Journal ] Sae-Young Chung , Thomas J. Richardson , Rüdiger L. Urbanke Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:657-670 [Journal ] Changyan Di , David Proietti , Ì. Emre Telatar , Thomas J. Richardson , Rüdiger L. Urbanke Finite-length analysis of low-density parity-check codes on the binary erasure channel. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2002, v:48, n:6, pp:1570-1579 [Journal ] Alexander J. Grant , Bixio Rimoldi , Rüdiger L. Urbanke , Philip A. Whiting Rate-splitting multiple access for discrete memoryless channels. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2001, v:47, n:3, pp:873-890 [Journal ] Bertrand M. Hochwald , Thomas L. Marzetta , Thomas J. Richardson , Wim Sweldens , Rüdiger L. Urbanke Systematic design of unitary space-time constellations. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2000, v:46, n:6, pp:1962-1973 [Journal ] Amos Lapidoth , Ì. Emre Telatar , Rüdiger L. Urbanke On wide-band broadcast channels. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2003, v:49, n:12, pp:3250-3258 [Journal ] Henry D. Pfister , Igal Sason , Rüdiger L. Urbanke Capacity-achieving ensembles for the binary erasure channel with bounded complexity. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2005, v:51, n:7, pp:2352-2379 [Journal ] Thomas J. Richardson , Mohammad Amin Shokrollahi , Rüdiger L. Urbanke Design of capacity-approaching irregular low-density parity-check codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:619-637 [Journal ] Thomas J. Richardson , Rüdiger L. Urbanke The capacity of low-density parity-check codes under message-passing decoding. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:599-618 [Journal ] Thomas J. Richardson , Rüdiger L. Urbanke Efficient encoding of low-density parity-check codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:638-656 [Journal ] Bixio Rimoldi , Rüdiger L. Urbanke A rate-splitting approach to the Gaussian multiple-access channel. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1996, v:42, n:2, pp:364-375 [Journal ] Igal Sason , Ì. Emre Telatar , Rüdiger L. Urbanke On the asymptotic input-output weight distributions and thresholds of convolutionaland turbo-like encoders. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2002, v:48, n:12, pp:3052-3061 [Journal ] Igal Sason , Rüdiger L. Urbanke Parity-check density versus performance of binary linear block codes over memorylesssymmetric channels. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2003, v:49, n:7, pp:1611-1635 [Journal ] Igal Sason , Rüdiger L. Urbanke Complexity Versus Performance of Capacity-Achieving Irregular Repeat-Accumulate Codes on the Binary Erasure Channel. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2004, v:50, n:6, pp:1247-1256 [Journal ] Rüdiger L. Urbanke , Dakshi Agrawal A counterexample to a Voronoi region conjecture. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1995, v:41, n:4, pp:1195-1196 [Journal ] Rüdiger L. Urbanke , Bixio Rimoldi Lattice Codes Can Achieve Capacity on the AWGN Channel. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:273-278 [Journal ] Changyan Di , Thomas J. Richardson , Rüdiger L. Urbanke Weight Distribution of Low-Density Parity-Check Codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:4839-4855 [Journal ] Dakshi Agrawal , T. McGiffen , Thomas J. Richardson , Rüdiger L. Urbanke , D. Cox Correction to "Multiple-Antenna Signal Constellations for Fading Channels". [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2007, v:53, n:1, pp:440- [Journal ] Vishwambhar Rathi , Ruediger Urbanke Existence Proofs of Some EXIT Like Functions [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Andrea Montanari , Rüdiger L. Urbanke Modern Coding Theory: The Statistical Mechanics and Computer Science Point of View [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Kapil Bhattad , Vishwambhar Rathi , Ruediger Urbanke Degree Optimization and Stability Condition for the Min-Sum Decoder [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Abdelaziz Amraoui , Andrea Montanari , Ruediger Urbanke How to Find Good Finite-Length Codes: From Art Towards Science [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Maxwell Construction: The Hidden Bridge between Iterative and Maximum a Posteriori Decoding [Citation Graph (, )][DBLP ] Why We Can Not Surpass Capacity: The Matching Condition [Citation Graph (, )][DBLP ] The Generalized Area Theorem and Some of its Consequences [Citation Graph (, )][DBLP ] Density Evolution, Thresholds and the Stability Condition for Non-binary LDPC Codes [Citation Graph (, )][DBLP ] Coding for Network Coding [Citation Graph (, )][DBLP ] Exchange of Limits: Why Iterative Decoding Works [Citation Graph (, )][DBLP ] Lower Bounds on the Rate-Distortion Function of Individual LDGM Codes [Citation Graph (, )][DBLP ] Polar Codes: Characterization of Exponent, Bounds, and Constructions [Citation Graph (, )][DBLP ] Polar Codes for Channel and Source Coding [Citation Graph (, )][DBLP ] Polar Codes are Optimal for Lossy Source Coding [Citation Graph (, )][DBLP ] The Compound Capacity of Polar Codes [Citation Graph (, )][DBLP ] Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform so well over the BEC [Citation Graph (, )][DBLP ] On the scaling of Polar codes: I. The behavior of polarized channels [Citation Graph (, )][DBLP ] On the scaling of Polar Codes: II. The behavior of un-polarized channels [Citation Graph (, )][DBLP ] Threshold Saturation on BMS Channels via Spatial Coupling [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.154secs