Loading [MathJax]/jax/output/SVG/config.js
Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Problemy Peredachi Informatsii, 2015, Volume 51, Issue 3, Pages 3–14 (Mi ppi2176)  
This article is cited in 1 scientific paper (total 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
Full-text PDF (216 kB) Citations (1)
References:
PDF
HTML
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.
Received: 16.03.2015
Revised: 23.06.2015
English version:
Problems of Information Transmission, 2015, Volume 51, Issue 3, Pages 205–216
DOI: https://doi.org/10.1134/S0032946015030011
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: P. S. Rybin, V. V. Zyablov, “Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes”, Probl. Peredachi Inf., 51:3 (2015), 3–14; Problems Inform. Transmission, 51:3 (2015), 205–216
Citation in format AMSBIB
\Bibitem{RybZya15}
\by P.~S.~Rybin, V.~V.~Zyablov
\paper Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes
\jour Probl. Peredachi Inf.
\yr 2015
\vol 51
\issue 3
\pages 3--14
\mathnet{http://mi.mathnet.ru/ppi2176}
\elib{https://elibrary.ru/item.asp?id=24961687}
\transl
\jour Problems Inform. Transmission
\yr 2015
\vol 51
\issue 3
\pages 205--216
\crossref{https://doi.org/10.1134/S0032946015030011}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000363254900001}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84944446159}
Linking options:
  • https://www.mathnet.ru/eng/ppi2176
  • https://www.mathnet.ru/eng/ppi/v51/i3/p3
    • This publication is cited in the following 1 articles:
    1. Rybin P., Andreev K., Zyablov V., “Error Exponents of Ldpc Codes Under Low-Complexity Decoding”, Entropy, 23:2 (2021), 253  crossref  mathscinet  isi  scopus
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:350
    Full-text PDF :79
    References:57
    First page:9
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025