A unified approach for constructing binary and nonbinary quasi-cyclic LDPC codes under a single framework is presented. Six classes of binary and nonbinary quasi-cyclic LDPC codes are constructed based on primitive elements, additive subgroups, and cyclic subgroups of finite fields. Numerical results show that the codes constructed perform well over the AWGN channel with iterative decoding.
No takes yet. Share an insight, caveat, or question.
Song et al. (2009) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: