Algebraic constructions of quasi-cyclic LDPC codes – part I: for AWGN and binary random erasure channels

Authors:
Lan Lan;Lingqi Zeng;Ying Y. Tai;Lei Chen;Shu Lin;Khaled Abdel-Ghaffar
Affiliations:
Department of Electrical and Computer Engineering, University of California, Davis, CA;Department of Electrical and Computer Engineering, University of California, Davis, CA;Department of Electrical and Computer Engineering, University of California, Davis, CA;Department of Electrical and Computer Engineering, University of California, Davis, CA;Department of Electrical and Computer Engineering, University of California, Davis, CA;Department of Electrical and Computer Engineering, University of California, Davis, CA
Venue:
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Year:
2006

Citing 10
Cited 3

Error Control Coding, Second Edition

Error Control Coding, Second Edition
Good error-correcting codes based on very sparse matrices

IEEE Transactions on Information Theory
The capacity of low-density parity-check codes under message-passing decoding

IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory
Low-density parity-check codes based on finite geometries: a rediscovery and new results

IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel

IEEE Transactions on Information Theory
Combinatorial constructions of low-density parity-check codes for iterative decoding

IEEE Transactions on Information Theory
Construction of low-density parity-check codes based on balanced incomplete block designs

IEEE Transactions on Information Theory
On algebraic construction of Gallager and circulant low-density parity-check codes

IEEE Transactions on Information Theory
Codes on finite geometries

IEEE Transactions on Information Theory

Low complexity LDPC decoding scheme for DMB-TH

CSNA '07 Proceedings of the IASTED International Conference on Communication Systems, Networks, and Applications
Burst decoding of cyclic codes based on circulant parity-check matrices

IEEE Transactions on Information Theory
Algebraic construction of quasi-cyclic LDPC codes – part II: for AWGN and binary random and burst erasure channels

AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Quantified Score

Hi-index	0.06

Visualization

Abstract

This paper is the first part of a sequence of two papers that present algebraic constructions of quasi-cyclic LDPC codes for AWGN, binary random and burst erasure channels. In this paper, a class of quasi-cyclic LDPC codes for both AWGN and binary random erasure channels is constructed based on finite fields and special vector representations of finite field elements.