|
Problemy Peredachi Informatsii, 2013, Volume 49, Issue 4, Pages 41–56
(Mi ppi2122)
|
|
|
|
This article is cited in 2 scientific papers (total 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.
Received: 15.05.2013 Revised: 27.08.2013
Citation:
F. I. Ivanov, V. V. Zyablov, “Low-density parity-check codes based on Steiner systems and permutation matrices”, Probl. Peredachi Inf., 49:4 (2013), 41–56; Problems Inform. Transmission, 49:4 (2013), 333–347
Linking options:
https://www.mathnet.ru/eng/ppi2122 https://www.mathnet.ru/eng/ppi/v49/i4/p41
|
Statistics & downloads: |
Abstract page: | 516 | Full-text PDF : | 119 | References: | 59 | First page: | 14 |
|