22 citations · 35 across the 6 of their papers we have counts for
6 papers
Lower Bounds on the Rate-Distortion Function of Individual LDGM Codes
Shrinivas Kudekar, Ruediger Urbanke
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 val…
Exchange of Limits: Why Iterative Decoding Works
Satish Babu Korada, Ruediger Urbanke
We consider communication over binary-input memoryless output-symmetric channels using low-density parity-check codes and message-passing decoding. The asymptotic (in the length) p…
Coding for Network Coding
Andrea Montanari, Ruediger Urbanke
We consider communication over a noisy network under randomized linear network coding. Possible error mechanism include node- or link- failures, Byzantine behavior of nodes, or an…
Degree Optimization and Stability Condition for the Min-Sum Decoder
Kapil Bhattad, Vishwambhar Rathi, Ruediger Urbanke
The min-sum (MS) algorithm is arguably the second most fundamental algorithm in the realm of message passing due to its optimality (for a tree code) with respect to the {\em block…
Modern Coding Theory: The Statistical Mechanics and Computer Science Point of View
Andrea Montanari, Rudiger Urbanke
These are the notes for a set of lectures delivered by the two authors at the Les Houches Summer School on `Complex Systems' in July 2006. They provide an introduction to the basic…
Existence Proofs of Some EXIT Like Functions
Vishwambhar Rathi, Ruediger Urbanke
The Extended BP (EBP) Generalized EXIT (GEXIT) function introduced in \cite{MMRU05} plays a fundamental role in the asymptotic analysis of sparse graph codes. For transmission over…