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
References:
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:
    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:611
    Full-text PDF :137
    References:60
    First page:27
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024