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, 2012, Volume 48, Issue 4, Pages 3–29 (Mi ppi2091)  
This article is cited in 7 scientific papers (total in 7 papers)

Coding Theory

Analysis of the relation between properties of LDPC codes and the Tanner graph

V. V. Zyablov, P. S. Rybin

Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow
Full-text PDF (2083 kB) Citations (7)
References:
PDF
HTML
Abstract: A new method for estimating the number of errors guaranteed to be corrected by a low-density parity-check code is proposed. The method is obtained by analyzing edges with special properties of an appropriate Tanner graph. In this paper we consider binary LDPC codes with constituent single-parity-check and Hamming codes and an iterative decoding algorithm. Numerical results obtained for the proposed lower bound exceed similar results for the best previously known lower bounds.
Received: 27.10.2011
Revised: 12.07.2012
English version:
Problems of Information Transmission, 2012, Volume 48, Issue 4, Pages 297–323
DOI: https://doi.org/10.1134/S0032946012040011
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: V. V. Zyablov, P. S. Rybin, “Analysis of the relation between properties of LDPC codes and the Tanner graph”, Probl. Peredachi Inf., 48:4 (2012), 3–29; Problems Inform. Transmission, 48:4 (2012), 297–323
Citation in format AMSBIB
\Bibitem{ZyaRyb12}
\by V.~V.~Zyablov, P.~S.~Rybin
\paper Analysis of the relation between properties of LDPC codes and the Tanner graph
\jour Probl. Peredachi Inf.
\yr 2012
\vol 48
\issue 4
\pages 3--29
\mathnet{http://mi.mathnet.ru/ppi2091}
\transl
\jour Problems Inform. Transmission
\yr 2012
\vol 48
\issue 4
\pages 297--323
\crossref{https://doi.org/10.1134/S0032946012040011}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000314036400001}
Linking options:
  • https://www.mathnet.ru/eng/ppi2091
  • https://www.mathnet.ru/eng/ppi/v48/i4/p3
    • This publication is cited in the following 7 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
    2. Rybin P., Frolov A., 2018 10Th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (Icumt 2018): Emerging Technologies For Connected Society, International Conference on Ultra Modern Telecommunications and Control Systems & Workshops, IEEE, 2018  isi
    3. I. V. Zhilin, F. I. Ivanov, “Vectorizing computations at decoding of nonbinary codes with small density of checks”, Autom. Remote Control, 77:10 (2016), 1781–1791  mathnet  crossref  isi  elib
    4. P. S. Rybin, V. V. Zyablov, “Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes”, Problems Inform. Transmission, 51:3 (2015), 205–216  mathnet  crossref  isi  elib
    5. Rybin P., “on the Error-Correcting Capabilities of Low-Complexity Decoded Irregular Ldpc Codes”, 2014 IEEE International Symposium on Information Theory (Isit), IEEE International Symposium on Information Theory, IEEE, 2014, 3165–3169  isi
    6. Pavel Rybin, 2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems, 2014, 83  crossref
    7. Pavel Rybin, 2014 IEEE International Symposium on Information Theory, 2014, 3165  crossref
    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:648
    Full-text PDF :152
    References:74
    First page:27
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025