An introduction to low-density parity-check codes
Theoretical aspects of computer science
An Introduction to Low-Density Parity-Check Codes
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Design methodology for IRA codes
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Guest column: error-correcting codes and expander graphs
ACM SIGACT News
A Gaussian Noise Generator for Hardware-Based Simulations
IEEE Transactions on Computers
Sparse Parity-Check Matrices over ${GF(q)}$
Combinatorics, Probability and Computing
Construction of rate-compatible LDPC codes utilizing information shortening and parity puncturing
EURASIP Journal on Wireless Communications and Networking
An efficient LDPC code structure combined with the concept of difference family
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Distributed source coding techniques for lossless compression of hyperspectral images
EURASIP Journal on Applied Signal Processing
EURASIP Journal on Applied Signal Processing
A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Configurable LDPC Decoder Architectures for Regular and Irregular Codes
Journal of Signal Processing Systems
Discrete Applied Mathematics
Low-complexity high-speed decoder design for quasi-cyclic LDPC codes
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Information Theoretic Security
Foundations and Trends in Communications and Information Theory
Efficient encoding of QC-LDPC codes related to cyclic MDS codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
A MIMO receiver for WiMAX system
CSNA '07 Proceedings of the IASTED International Conference on Communication Systems, Networks, and Applications
Multiple-rate low-density parity-check codes with constant blocklength
IEEE Transactions on Communications
IEEE Transactions on Communications
Design of low-rate irregular LDPC codes using trellis search
IEEE Transactions on Communications
Toward low LDPC-code floors: a case study
IEEE Transactions on Communications
Architecture-aware LDPC code design for multiprocessor software defined radio systems
IEEE Transactions on Signal Processing
Distributed arithmetic coding for the Slepian-Wolf problem
IEEE Transactions on Signal Processing
A low-complexity hybrid LDPC code encoder for IEEE 802.3an (10GBase-T) ethernet
IEEE Transactions on Signal Processing
Complexity efficient stopping criterion for LDPC based distributed video coding
Proceedings of the 5th International ICST Mobile Multimedia Communications Conference
Low-density codes based on chaotic systems for simple encoding
IEEE Transactions on Circuits and Systems Part I: Regular Papers
Reversible low-density parity-check codes
IEEE Transactions on Information Theory
On the designs and challenges of practical binary dirty paper coding
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Performance enhancement of IEEE 802.11n wireless LAN using irregular LDPCC
WOCN'09 Proceedings of the Sixth international conference on Wireless and Optical Communications Networks
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
An efficient on-the-fly encoding algorithm for binary and finite field LDPC codes
IEEE Communications Letters
IEEE Transactions on Communications
The design of efficiently-encodable rate-compatible LDPC codes
IEEE Transactions on Communications
Hardware designing for ABS-S modulator
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Performance analysis of LDPC codes for invariance of channel estimation
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Design of irregular LDPC codes with optimized performance-complexity tradeoff
IEEE Transactions on Communications
Joint nonlinear channel equalization and soft LDPC decoding with Gaussian processes
IEEE Transactions on Signal Processing
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Practical dirty paper coding with nested binary LDGM-LDPC codes
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Low complexity encoder for generalized quasi-cyclic codes coming from finite geometries
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Linear time encoding of LDPC codes
IEEE Transactions on Information Theory
On the undetected error probability of binary matrix ensembles
IEEE Transactions on Information Theory
Symbol based log-map in concatenated LDPC-convolutional codes
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Performance and complexity tradeoffs of space-time modulation and coding schemes
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
HotDep'08 Proceedings of the Fourth conference on Hot topics in system dependability
Algorithms and theory of computation handbook
Regular {4,8} LDPC codes and their low error floors
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
Effects of channel estimation on multiuser virtual MIMO-OFDMA relay-based networks
EURASIP Journal on Wireless Communications and Networking
ICCOM'06 Proceedings of the 10th WSEAS international conference on Communications
Fixed-point MAP decoding of channel codes
EURASIP Journal on Advances in Signal Processing - Special issue on quantization of VLSI digital signal processing systems
On the iterative decoding of sparse quantum codes
Quantum Information & Computation
Design of Efficiently Encodable Rate-Compatible LDPC Codes Using Vandermonde Extension Matrices
Wireless Personal Communications: An International Journal
Efficient decoding of QC-LDPC codes using GPUs
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
Linear time decoding of regular expander codes
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
On the wiretap channel induced by noisy tags
ESAS'06 Proceedings of the Third European conference on Security and Privacy in Ad-Hoc and Sensor Networks
Foundations and Trends in Communications and Information Theory
Message length adaptive LDPC codes
Digital Signal Processing
Decoding robustness performance comparison for QR and data matrix code
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Linear-time decoding of regular expander codes
ACM Transactions on Computation Theory (TOCT) - Special issue on innovations in theoretical computer science 2012
A fast LDPC encoder/decoder for small/medium codes
Microelectronics Journal
| Hi-index | 755.03 |
Low-density parity-check (LDPC) codes can be considered serious competitors to turbo codes in terms of performance and complexity and they are based on a similar philosophy: constrained random code ensembles and iterative decoding algorithms. We consider the encoding problem for LDPC codes. More generally we consider the encoding problem for codes specified by sparse parity-check matrices. We show how to exploit the sparseness of the parity-check matrix to obtain efficient encoders. For the (3,6)-regular LDPC code, for example, the complexity of encoding is essentially quadratic in the block length. However, we show that the associated coefficient can be made quite small, so that encoding codes even of length n≃100000 is still quite practical. More importantly, we show that “optimized” codes actually admit linear time encoding