This article is cited in 2 papers

Coding Theory

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

F. I. Ivanov, V. V. Zyablov

Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

Abstract: 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^m-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.

UDC: 621.391.15

Received: 15.05.2013
Revised: 27.08.2013

 English version: Problems of Information Transmission, 2013, 49:4, 333–347

Bibliographic databases:

• 
•