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

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. © Springer-Verlag Berlin Heidelberg 2006.