• Publications
  • Influence
The capacity of low-density parity-check codes under message-passing decoding
TLDR
The results are based on the observation that the concentration of the performance of the decoder around its average performance, as observed by Luby et al. in the case of a binary-symmetric channel and a binary message-passing algorithm, is a general phenomenon. Expand
Design of capacity-approaching irregular low-density parity-check codes
TLDR
This work designs low-density parity-check codes that perform at rates extremely close to the Shannon capacity and proves a stability condition which implies an upper bound on the fraction of errors that a belief-propagation decoder can correct when applied to a code induced from a bipartite graph with a given degree distribution. Expand
Modern Coding Theory
TLDR
This summary of the state-of-the-art in iterative coding makes this decision more straightforward, with emphasis on the underlying theory, techniques to analyse and design practical iterative codes systems. Expand
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
TLDR
By using the Gaussian approximation for message densities under density evolution, the sum-product decoding algorithm can be visualize and the optimization of degree distributions can be understood and done graphically using the visualization. Expand
Systematic design of unitary space-time constellations
TLDR
This paper proposes a systematic method for creating constellations of unitary space-time signals for multiple-antenna communication links and systematically produces the remaining signals by successively rotating this signal in a high-dimensional complex space. Expand
On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
TLDR
Improved algorithms are developed to construct good low-density parity-check codes that approach the Shannon limit very closely, especially for rate 1/2. Expand
Finite-length analysis of low-density parity-check codes on the binary erasure channel
TLDR
This paper presents a meta-modelling architecture suitable for smart grids that was developed at the 39th Allerton Conf. Expand
Efficient encoding of low-density parity-check codes
TLDR
It is shown how to exploit the sparseness of the parity-check matrix to obtain efficient encoders and it is shown that "optimized" codes actually admit linear time encoding. Expand
Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC
TLDR
The fundamental mechanism which explains why “convolutional-like” or “spatially coupled” codes perform so well is described, and it is conjecture that for a large range of graphical systems a similar collapse of thresholds occurs once individual components are coupled sufficiently strongly. Expand
Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC
TLDR
The fundamental mechanism that explains why “convolutional-like” or “spatially coupled” codes perform so well is described, and it is conjecture that for a large range of graphical systems a similar saturation of the “dynamical” threshold occurs once individual components are coupled sufficiently strongly. Expand
...
1
2
3
4
5
...