This article is cited in 1 paper

Coding Theory

Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes

P. S. Rybin, V. V. Zyablov

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

Abstract: Two ensembles of low-density parity-check (LDPC) codes with low-complexity decoding algorithms are considered. The first ensemble consists of generalized LDPC codes, and the second consists of concatenated codes with an outer LDPC code. Error exponent lower bounds for these ensembles under the corresponding low-complexity decoding algorithms are compared. A modification of the decoding algorithm of a generalized LDPC code with a special construction is proposed. The error exponent lower bound for the modified decoding algorithm is obtained. Finally, numerical results for the considered error exponent lower bounds are presented and analyzed.

UDC: 621.391.15

Received: 16.03.2015
Revised: 23.06.2015

 English version: Problems of Information Transmission, 2015, 51:3, 205–216

Bibliographic databases:

• 
• 
•