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

Authors:
F. I. Ivanov;V. V. Zyablov
Affiliations:
Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia;Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Venue:
Problems of Information Transmission
Year:
2007

Citing 4
Cited 0

Low-density parity-check codes based on finite geometries: a rediscovery and new results

IEEE Transactions on Information Theory
A recursive approach to low complexity codes

IEEE Transactions on Information Theory
Quasicyclic low-density parity-check codes from circulant permutation matrices

IEEE Transactions on Information Theory
Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than 12

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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 = 2m 驴 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.