The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rüdiger L. Urbanke: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. 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]
  24. 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]
  25. Vishwambhar Rathi, Ruediger Urbanke
    Existence Proofs of Some EXIT Like Functions [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  26. 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]
  27. 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]
  28. 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]

  29. Maxwell Construction: The Hidden Bridge between Iterative and Maximum a Posteriori Decoding [Citation Graph (, )][DBLP]


  30. Why We Can Not Surpass Capacity: The Matching Condition [Citation Graph (, )][DBLP]


  31. The Generalized Area Theorem and Some of its Consequences [Citation Graph (, )][DBLP]


  32. Density Evolution, Thresholds and the Stability Condition for Non-binary LDPC Codes [Citation Graph (, )][DBLP]


  33. Coding for Network Coding [Citation Graph (, )][DBLP]


  34. Exchange of Limits: Why Iterative Decoding Works [Citation Graph (, )][DBLP]


  35. Lower Bounds on the Rate-Distortion Function of Individual LDGM Codes [Citation Graph (, )][DBLP]


  36. Polar Codes: Characterization of Exponent, Bounds, and Constructions [Citation Graph (, )][DBLP]


  37. Polar Codes for Channel and Source Coding [Citation Graph (, )][DBLP]


  38. Polar Codes are Optimal for Lossy Source Coding [Citation Graph (, )][DBLP]


  39. The Compound Capacity of Polar Codes [Citation Graph (, )][DBLP]


  40. Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform so well over the BEC [Citation Graph (, )][DBLP]


  41. On the scaling of Polar codes: I. The behavior of polarized channels [Citation Graph (, )][DBLP]


  42. On the scaling of Polar Codes: II. The behavior of un-polarized channels [Citation Graph (, )][DBLP]


  43. Threshold Saturation on BMS Channels via Spatial Coupling [Citation Graph (, )][DBLP]


Search in 0.019secs, Finished in 0.020secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002