| Publication | Date of Publication | Type |
|---|
The Stability of Low-Density Parity-Check Codes and Some of its Consequences
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Near-Optimal Finite-Length Scaling for Polar Codes Over Large Alphabets
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Displacement Convexity in Spatially Coupled Scalar Recursions
IEEE Transactions on Information Theory | 2019-01-18 | Paper |
Reed-Muller codes achieve capacity on erasure channels
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Reed–Muller Codes Achieve Capacity on Erasure Channels
IEEE Transactions on Information Theory | 2017-09-21 | Paper |
Finite-Length Scaling for Iteratively Decoded LDPC Ensembles
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
The Generalized Area Theorem and Some of its Consequences
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Polar Codes: Characterization of Exponent, Bounds, and Constructions
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Polar Codes are Optimal for Lossy Source Coding
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Exchange of Limits: Why Iterative Decoding Works
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Windowed Decoding of Spatially Coupled Codes
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Iterative Coding for Network Coding
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Finite-Length Scaling for Polar Codes
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Linear Programming Decoding of Spatially Coupled Codes
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Spatial Coupling as a Proof Technique and Three Applications
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Wave-Like Solutions of General 1-D Spatially Coupled Systems
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Achieving Marton’s Region for Broadcast Channels Using Polar Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Error correcting codes and spatial coupling
Statistical Physics, Optimization, Inference, and Message-Passing Algorithms | 2016-07-29 | Paper |
Threshold saturation in spatially coupled constraint satisfaction problems
Journal of Statistical Physics | 2013-05-07 | Paper |
Turbo Codes in Binary Erasure Channel
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Maxwell Construction: The Hidden Bridge Between Iterative and Maximuma PosterioriDecoding
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Exact Thresholds and Optimal Codes for the Binary-Symmetric Channel and Gallager's Decoding Algorithm A
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Weight Distribution of Low-Density Parity-Check Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Complexity Versus Performance of Capacity-Achieving Irregular Repeat–Accumulate Codes on the Binary Erasure Channel
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
On wide-band broadcast channels
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Parity-check density versus performance of binary linear block codes over memoryless symmetric channels
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
| Modern Coding Theory | 2008-06-05 | Paper |
Fixed points and stability of density evolution
Communications in Information and Systems | 2006-03-16 | Paper |
Finite-length analysis of low-density parity-check codes on the binary erasure channel
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
On the asymptotic input-output weight distributions and thresholds of convolutional and turbo-like encoders
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
Systematic design of unitary space-time constellations
IEEE Transactions on Information Theory | 2002-10-30 | Paper |
| scientific article; zbMATH DE number 1714646 (Why is no real title available?) | 2002-10-21 | Paper |
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Efficient encoding of low-density parity-check codes
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Multiple-antenna signal constellations for fading channels
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Rate-splitting multiple access for discrete memoryless channels
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Lattice codes can achieve capacity on the AWGN channel
IEEE Transactions on Information Theory | 1998-06-08 | Paper |
Twist points of the von Koch snowflake
Proceedings of the American Mathematical Society | 1998-03-24 | Paper |
An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms
Experimental Mathematics | 1997-04-13 | Paper |
An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms
Experimental Mathematics | 1997-04-13 | Paper |
An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms
Experimental Mathematics | 1997-04-13 | Paper |
A rate-splitting approach to the Gaussian multiple-access channel
IEEE Transactions on Information Theory | 1997-02-25 | Paper |
A counterexample to a Voronoi region conjecture
IEEE Transactions on Information Theory | 1997-01-30 | Paper |
| scientific article; zbMATH DE number 852126 (Why is no real title available?) | 1996-03-21 | Paper |
| scientific article; zbMATH DE number 852126 (Why is no real title available?) | 1996-03-21 | Paper |
