Low-density parity-check codes based on the independent subgroups

Abstract

Two criteria of cyclic subgroups independence are proved. The ensemble of regular binary LDPC codes which are based on independent subgroups, is built. The condition of absence of the cycles of the length 4 is proved for the resulting code construction. The results of the received code constructions are presented for the iterative algorithm Sum-Product when the codeword is transmitted over channel with additive Gaussian white noise (AGWN).