Rüdiger L. Urbanke

Benyuan Zhu

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.

[BibT_eX]

[DOI]

Pablo M. Olmos

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

The least degraded and the least upgraded channel with respect to a channel family.

[BibT_eX]

[DOI]

Wei Liu

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Displacement convexity - A useful framework for the study of spatially coupled codes.

[BibT_eX]

[DOI]

Rafah El-Khatib

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

The space of solutions of coupled XORSAT formulae.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

And now to something completely different: Spatial coupling as a proof technique.

[BibT_eX]

[DOI]

Andrei Giurgiu

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Wave-Like Solutions of General One-Dimensional Spatially Coupled Systems

[BibT_eX]

[DOI]

Tom Richardson

CoRR, 2012

Polar codes: Robustness of the successive cancellation decoder with respect to quantization.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Universal bounds on the scaling behavior of polar codes.

[BibT_eX]

[DOI]

Ali Goli

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

How to prove the Maxwell conjecture via spatial coupling - A proof of concept.

[BibT_eX]

[DOI]

Andrei Giurgiu

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Lossy source coding via spatially coupled LDGM ensembles.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Exchange of Limits: Why Iterative Decoding Works.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Threshold Saturation in Spatially Coupled Constraint Satisfaction Problems

[BibT_eX]

[DOI]

CoRR, 2011

Chains of Mean Field Models

[BibT_eX]

[DOI]

CoRR, 2011

Reliability of Clustered vs. Declustered Replica Placement in Data Storage Systems.

[BibT_eX]

[DOI]

Proceedings of the MASCOTS 2011, 2011

Existence and uniqueness of GEXIT curves via the Wasserstein metric.

[BibT_eX]

[DOI]

Tom Richardson

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Universal rateless codes from coupled LT codes.

[BibT_eX]

[DOI]

Vahid Aref

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Rate-equivocation optimal spatially coupled LDPC codes for the BEC wiretap channel.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Scaling behavior of convolutional LDPC ensembles over the BEC.

[BibT_eX]

[DOI]

Pablo M. Olmos

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

A mobile world of security - The model.

[BibT_eX]

[DOI]

Proceedings of the 45st Annual Conference on Information Sciences and Systems, 2011

2010

Polar codes are optimal for lossy source coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Polar Codes: Characterization of Exponent, Bounds, and Constructions.

[BibT_eX]

[DOI]

Eren Sasoglu

IEEE Trans. Inf. Theory, 2010

Threshold Saturation on BMS Channels via Spatial Coupling

[BibT_eX]

[DOI]

CoRR, 2010

Coupled graphical models and their thresholds.

[BibT_eX]

[DOI]

S. Hamed Hassani

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

An empirical scaling law for polar codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

On the scaling of polar codes: I. The behavior of polarized channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

On the scaling of polar codes: II. The behavior of un-polarized channels.

[BibT_eX]

[DOI]

Kasra Alishahi

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

The generalized area theorem and some of its consequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Finite-Length Scaling for Iteratively Decoded LDPC Ensembles.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Polar Codes for Channel and Source Coding

[BibT_eX]

[DOI]

Nadine Hussami

CoRR, 2009

Waterfall region performance of punctured LDPC codes over the BEC.

[BibT_eX]

[DOI]

Iryna Andriyanova

Proceedings of the IEEE International Symposium on Information Theory, 2009

Performance of polar codes for channel and source coding.

[BibT_eX]

[DOI]

Nadine Hussami

Proceedings of the IEEE International Symposium on Information Theory, 2009

The compound capacity of polar codes.

[BibT_eX]

[DOI]

S. Hamed Hassani

Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008

Maxwell Construction: The Hidden Bridge Between Iterative and Maximum a Posteriori Decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Turbo Codes in Binary Erasure Channel.

[BibT_eX]

[DOI]

Jeong Woo Lee

Richard E. Blahut

IEEE Trans. Inf. Theory, 2008

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

[BibT_eX]

[DOI]

CoRR, 2008

Computing the threshold shift for general channels.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

The slope scaling parameter for general channels, decoders, and ensembles.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Modern Coding Theory.

[BibT_eX]

[DOI]

Cambridge University Press, ISBN: 9780511791338, 2008

2007

Correction to "Multiple-Antenna Signal Constellations for Fading Channels".

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

On the performance of turbo codes over the binary erasure channel.

[BibT_eX]

[DOI]

Jeong Woo Lee

Richard E. Blahut

IEEE Commun. Lett., 2007

How to find good finite-length codes: from art towards science.

[BibT_eX]

[DOI]

Abdelaziz Amraoui

Eur. Trans. Telecommun., 2007

Coding for Network Coding

[BibT_eX]

[DOI]

CoRR, 2007

Degree Optimization and Stability Condition for the Min-Sum Decoder

[BibT_eX]

[DOI]

Kapil Bhattad

Vishwambhar Rathi

CoRR, 2007

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

[BibT_eX]

[DOI]

CoRR, 2007

Existence Proofs of Some EXIT Like Functions.

[BibT_eX]

[DOI]

Vishwambhar Rathi

Proceedings of the IEEE International Symposium on Information Theory, 2007

Asymptotic Rate versus Design Rate.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

A Generalization of the Finite-Length Scaling Approach Beyond the BEC.

[BibT_eX]

[DOI]

Jeremie Ezri

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Weight Distribution of Low-Density Parity-Check Codes.

[BibT_eX]

[DOI]

Changyan Di

IEEE Trans. Inf. Theory, 2006

New directions in information theory.

[BibT_eX]

[DOI]

Eur. Trans. Telecommun., 2006

Analytic Determination of Scaling Parameters.

[BibT_eX]

[DOI]

Abdelaziz Amraoui

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

Capacity-achieving ensembles for the binary erasure channel with bounded complexity.

[BibT_eX]

[DOI]

Henry D. Pfister

IEEE Trans. Inf. Theory, 2005

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

[BibT_eX]

[DOI]

Vishwambhar Rathi

CoRR, 2005

Why We Can Not Surpass Capacity: The Matching Condition

[BibT_eX]

[DOI]

CoRR, 2005

Finite-length scaling of irregular LDPC code ensembles.

[BibT_eX]

[DOI]

Abdelaziz Amraoui

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Exact Thresholds and Optimal Codes for the Binary-Symmetric Channel and Gallager's Decoding Algorithm A.

[BibT_eX]

[DOI]

Louay Bazzi

IEEE Trans. Inf. Theory, 2004

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

[BibT_eX]

[DOI]

CoRR, 2004

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

[BibT_eX]

[DOI]

CoRR, 2004

Bounds on the decoding complexity of punctured codes on graphs

[BibT_eX]

[DOI]

Henry D. Pfister

CoRR, 2004

Fixed Points and Stability of Density Evolution.

[BibT_eX]

[DOI]

Commun. Inf. Syst., 2004

Maxwell's construction: the hidden bridge between maximum-likelihood and iterative decoding.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Weight distributions of LDPC code ensembles: combinatorics meets statistical physics.

[BibT_eX]

[DOI]

Changyan Di

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Further results on finite-length scaling for iteratively decoded LDPC ensembles.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

On wide-band broadcast channels.

[BibT_eX]

[DOI]

Amos Lapidoth

I. Emre Telatar

IEEE Trans. Inf. Theory, 2003

The renaissance of Gallager's low-density parity-check codes.

[BibT_eX]

[DOI]

Tom Richardson

IEEE Commun. Mag., 2003

2002

On the asymptotic input-output weight distributions and thresholds of convolutionaland turbo-like encoders.

[BibT_eX]

[DOI]

I. Emre Telatar

IEEE Trans. Inf. Theory, 2002

Finite-length analysis of low-density parity-check codes on the binary erasure channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

2001

Efficient encoding of low-density parity-check codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

The capacity of low-density parity-check codes under message-passing decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

Design of capacity-approaching irregular low-density parity-check codes.

[BibT_eX]

[DOI]

Mohammad Amin Shokrollahi

IEEE Trans. Inf. Theory, 2001

Rate-splitting multiple access for discrete memoryless channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation.

[BibT_eX]

[DOI]

Sae-Young Chung

IEEE Trans. Inf. Theory, 2001

Multiple-antenna signal constellations for fading channels.

[BibT_eX]

[DOI]

Dakshi Agrawal

IEEE Trans. Inf. Theory, 2001

On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2001

2000

Systematic design of unitary space-time constellations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

1999

Efficient implementation of parallel decision feedback decoders for broadband applications.

[BibT_eX]

[DOI]

Rajeev Krishnamoorthy

Proceedings of the 6th IEEE International Conference on Electronics, Circuits and Systems, 1999

1998

Lattice Codes Can Achieve Capacity on the AWGN Channel.

[BibT_eX]

[DOI]

Bixio Rimoldi

IEEE Trans. Inf. Theory, 1998

1996

A rate-splitting approach to the Gaussian multiple-access channel.

[BibT_eX]

[DOI]

Bixio Rimoldi

IEEE Trans. Inf. Theory, 1996

1995

A counterexample to a Voronoi region conjecture.

[BibT_eX]

[DOI]

Dakshi Agrawal

IEEE Trans. Inf. Theory, 1995

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

[BibT_eX]

[DOI]

Franz Hlawatsch

Thulasinath G. Manickam

William Jones

Signal Process., 1995

An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms.

[BibT_eX]

[DOI]

Fausto Di Biase