Low-density parity-check codes based on steiner systems and permutation matrices.

An algorithm for generating parity-check matrices of regular low-density paritycheck codes based on permutation matrices and Steiner triple systems S( v, 3, 2), v = 2 − 1, is proposed. Estimations of the rate, minimum distance, and girth for obtained code constructions are presented. Results of simulation of the obtained code constructions for an iterative 'belief propagation' (Sum-Product) decoding algorithm applied in the case of transmission over a binary channel with additive Gaussian white noise and BPSK modulation are presented. [ABSTRACT FROM AUTHOR]