Randomness conductors and constant-degree lossless expanders
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
An FPGA implementation of (3, 6)-regular low-density parity-check code decoder
EURASIP Journal on Applied Signal Processing
Probabilistic analysis of linear programming decoding
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Graphical Models, Exponential Families, and Variational Inference
Foundations and Trends® in Machine Learning
Performance of Standard Irregular LDPC Codes under Maximum Likelihood Decoding
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Detailed Evolution of Degree Distributions in Residual Graphs with Joint Degree Distributions
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Capacity-approaching protograph codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Predicting error floors of structured LDPC codes: deterministic bounds and estimates
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
High-throughput layered decoder implementation for quasi-cyclic LDPC codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Gallager's decoding algorithm A over high order modulations
IEEE Communications Letters
New insights into weighted bit-flipping decoding
IEEE Transactions on Communications
Reversible low-density parity-check codes
IEEE Transactions on Information Theory
Upper bound on error exponent of regular LDPC codes transmitted over the BEC
IEEE Transactions on Information Theory
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Low Density Parity Check Code for the Single Carrier Frequency Division Multiple Access
FGIT '09 Proceedings of the 1st International Conference on Future Generation Information Technology
Efficient LDPC codes over GF(q) for Lossy data compression
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Weight distributions of multi-edge type LDPC codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
The generalized area theorem and some of its consequences
IEEE Transactions on Information Theory
Iterative approximate linear programming decoding of LDPC codes with linear complexity
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Linear LLR approximation for iterative decoding on wireless channels
IEEE Transactions on Communications
Burst erasure correcting LDPC codes
IEEE Transactions on Communications
UEP-LDPC codes with high spectral efficiency in image transmission
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
EXIT trajectories of irregular LDPC codes
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Low-density graph codes that are optimal for binning and coding with side information
IEEE Transactions on Information Theory
Design of irregular LDPC codes with optimized performance-complexity tradeoff
IEEE Transactions on Communications
Modulation-assisted UEP-LDPC codes in image transmission
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Minimum distance computation of LDPC codes using a branch and cut algorithm
IEEE Transactions on Communications
Network coding for distributed storage systems
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Capacity-approaching irregular turbo codes for the binary erasure channel
IEEE Transactions on Communications
Algorithms and theory of computation handbook
Lossy source compression using low-density generator matrix codes: analysis and algorithms
IEEE Transactions on Information Theory
An implementation-friendly binary LDPC decoding algorithm
IEEE Transactions on Communications
LDPC code design considerations for non-uniform channels
IEEE Transactions on Communications
Protograph LDPC codes over burst erasure channels
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Proceedings of the Sixth Asian Internet Engineering Conference
Approximate-min* constraint node updating for LDPC code decoding
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
The universality of LDPC codes on wireless channels
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
Improved design of unequal error protection LDPC codes
EURASIP Journal on Wireless Communications and Networking
Symmetric LDPC codes and local testing
Property testing
Symmetric LDPC codes and local testing
Property testing
Efficient reversible data hiding in encrypted images
Journal of Visual Communication and Image Representation
Hi-index | 755.38 |
We construct new families of error-correcting codes based on Gallager's (1973) low-density parity-check codes. We improve on Gallager's results by introducing irregular parity-check matrices and a new rigorous analysis of hard-decision decoding of these codes. We also provide efficient methods for finding good irregular structures for such decoding algorithms. Our rigorous analysis based on martingales, our methodology for constructing good irregular codes, and the demonstration that irregular structure improves performance constitute key points of our contribution. We also consider irregular codes under belief propagation. We report the results of experiments testing the efficacy of irregular codes on both binary-symmetric and Gaussian channels. For example, using belief propagation, for rate 1/4 codes on 16000 bits over a binary-symmetric channel, previous low-density parity-check codes can correct up to approximately 16% errors, while our codes correct over 17%. In some cases our results come very close to reported results for turbo codes, suggesting that variations of irregular low density parity-check codes may be able to match or beat turbo code performance