Regular non-binary quasi-cyclic LDPC codes for high-rate applications
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Efficient encoding of QC-LDPC codes related to cyclic MDS codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
IEEE Transactions on Communications
High performance non-binary quasi-cyclic LDPC codes on euclidean geometries
IEEE Transactions on Communications
On universal properties of capacity-approaching LDPC code ensembles
IEEE Transactions on Information Theory
Lower bounds on the graphical complexity of finite-length LDPC codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Construction of QC LDPC codes based on cyclic subgroup over GF(q)
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
A binary message-passing decoding algorithm for LDPC codes
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Quasi-cyclic LDPC codes: an algebraic construction
IEEE Transactions on Communications
Construction of quasi-cyclic LDPC codes based on a two-dimensional MDS code
IEEE Communications Letters
Systematic design of low-density parity-check code ensembles for binary erasure channels
IEEE Transactions on Communications
QSN: a simple circular-shift network for reconfigurable quasi-cyclic LDPC decoders
IEEE Transactions on Circuits and Systems II: Express Briefs
Quasi-cyclic LDPC codes: an algebraic construction, rank analysis, and codes on Latin squares
IEEE Transactions on Communications
Two low-complexity reliability-based message-passing algorithms for decoding non-binary LDPC codes
IEEE Transactions on Communications
PN Code Acquisition Using Belief Propagation with Adaptive Parity Check Matrix
Wireless Personal Communications: An International Journal
A fast LDPC encoder/decoder for small/medium codes
Microelectronics Journal
| Hi-index | 754.90 |
In the late 1950s and early 1960s, finite fields were successfully used to construct linear block codes, especially cyclic codes, with large minimum distances for hard-decision algebraic decoding, such as Bose-Chaudhuri-Hocquenghem (BCH) and Reed-Solomon (RS) codes. This paper shows that finite fields can also be successfully used to construct algebraic low-density parity-check (LDPC) codes for iterative soft-decision decoding. Methods of construction are presented. LDPC codes constructed by these methods are quasi-cyclic (QC) and they perform very well over the additive white Gaussian noise (AWGN), binary random, and burst erasure channels with iterative decoding in terms of bit-error probability, block-error probability, error-floor, and rate of decoding convergence, collectively. Particularly, they have low error floors. Since the codes are QC, they can be encoded using simple shift registers with linear complexity.